Generic fully simulatable adaptive oblivious transfer
From MaRDI portal
Publication:3011306
DOI10.1007/978-3-642-21554-4_16zbMATH Open1288.94070OpenAlexW158064101MaRDI QIDQ3011306FDOQ3011306
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
Recommendations
Cites Work
- Introduction to algorithms
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Universally Composable Adaptive Oblivious Transfer
- Verifiable Shuffle of Large Size Ciphertexts
- Public-Key Cryptosystems Resilient to Key Leakage
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Practical Adaptive Oblivious Transfer from Simple Assumptions
- Title not available (Why is that?)
- Simulatable Adaptive Oblivious Transfer
- Title not available (Why is that?)
- Oblivious keyword search
- Title not available (Why is that?)
- Quantum Communication Attacks on Classical Cryptographic Protocols
- Simple adaptive oblivious transfer without random oracle
- Title not available (Why is that?)
- Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings
- New Approach for Selectively Convertible Undeniable Signature Schemes
- On the Amortized Complexity of Zero-Knowledge Protocols
- Title not available (Why is that?)
- Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
Cited In (8)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy
- Adaptive Oblivious Transfer and Generalization
- Simulatable Adaptive Oblivious Transfer
- Fully-Simulatable Oblivious Set Transfer
- Adaptive oblivious transfer with access control from lattice assumptions
- Simple adaptive oblivious transfer without random oracle
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
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)