Generic fully simulatable adaptive oblivious transfer

DOI10.1007/978-3-642-21554-4_16MaRDI QIDQ3011306zbMATHOpenAlexFDO

Authors Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong

Publication date 28 June 2011

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21554-4_16

zbMATH Keywords

permutation networksadaptive OTfully-simulatableloose homomorphismverifiable shuffles

Mathematics Subject Classification ID

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

Recommendations

• Simulatable Adaptive Oblivious Transfer
• Simple adaptive oblivious transfer without random oracle
• Simulatable adaptive oblivious transfer with statistical receiver's privacy
• scientific article; zbMATH DE number 1302802
• Equivocable oblivious transfer

Cites work

• scientific article; zbMATH DE number 4170086 (Why is no real title available?)
• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 177049 (Why is no real title available?)
• scientific article; zbMATH DE number 1418318 (Why is no real title available?)
• scientific article; zbMATH DE number 1440068 (Why is no real title available?)
• Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings
• Efficiency-improved fully simulatable adaptive OT under the DDH assumption
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Introduction to algorithms
• New Approach for Selectively Convertible Undeniable Signature Schemes
• Oblivious keyword search
• On the Amortized Complexity of Zero-Knowledge Protocols
• Practic zero-knowledge proofs: Giving hints and using deficiencies
• Practical adaptive oblivious transfer from simple assumptions
• Public-Key Cryptosystems Resilient to Key Leakage
• Quantum communication attacks on classical cryptographic protocols. (Invited talk)
• Randomized Shellsort, a simple oblivious sorting algorithm
• Simple adaptive oblivious transfer without random oracle
• Simulatable Adaptive Oblivious Transfer
• Verifiable Shuffle of Large Size Ciphertexts

Cited in

(10)

• Simple adaptive oblivious transfer without random oracle
• Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
• Simulatable adaptive oblivious transfer with statistical receiver's privacy
• Efficiency-improved fully simulatable adaptive OT under the DDH assumption
• Simulatable Adaptive Oblivious Transfer
• Equivocable oblivious transfer
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
• Fully-Simulatable Oblivious Set Transfer
• Adaptive oblivious transfer with access control from lattice assumptions
• Adaptive oblivious transfer and generalization

This page was built for publication: Generic fully simulatable adaptive oblivious transfer

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