Efficient concurrent oblivious transfer in super-polynomial-simulation security

DOI10.1007/978-3-642-34117-5_14MaRDI QIDQ4912413zbMATH OpenOpenAlexFDO

Authors Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Publication date 4 April 2013

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34117-5_14

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient fully-simulatable oblivious transfer
• Efficient Fully-Simulatable Oblivious Transfer
• Fully-Simulatable Oblivious Set Transfer
• Efficient oblivious transfer protocols
• A new approach to black-box concurrent secure computation

Cited in

(1)

• Fully-Simulatable Oblivious Set Transfer

This page was built for publication: Efficient concurrent oblivious transfer in super-polynomial-simulation security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912413)