Generic Fully Simulatable Adaptive Oblivious Transfer

DOI10.1007/978-3-642-21554-4_16zbMath1288.94070MaRDI QIDQ3011306

Ryo Nojima, Kaoru Kurosawa, 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 networks; adaptive OT; fully-simulatable; loose homomorphism; verifiable shuffles

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Related Items

Adaptive oblivious transfer with access control from lattice assumptions, Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost, Adaptive Oblivious Transfer and Generalization, Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings
• Practic zero-knowledge proofs: Giving hints and using deficiencies
• Oblivious keyword search
• Practical Adaptive Oblivious Transfer from Simple Assumptions
• Quantum Communication Attacks on Classical Cryptographic Protocols
• On the Amortized Complexity of Zero-Knowledge Protocols
• Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
• Universally Composable Adaptive Oblivious Transfer
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Simple Adaptive Oblivious Transfer without Random Oracle
• Simulatable Adaptive Oblivious Transfer
• New Approach for Selectively Convertible Undeniable Signature Schemes
• Verifiable Shuffle of Large Size Ciphertexts
• Public-Key Cryptosystems Resilient to Key Leakage