Efficient Fully-Simulatable Oblivious Transfer

DOI10.1007/978-3-540-79263-5_4zbMath1153.94406OpenAlexW2171229805MaRDI QIDQ5458932

Andrew Y. Lindell

Publication date: 24 April 2008

Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79263-5_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Classically verifiable NIZK for QMA with preprocessing ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Solutions to the anti-piracy problem in oblivious transfer ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Round Optimal Universally Composable Oblivious Transfer Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Strict Polynomial-Time in Simulation and Extraction
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Blind Identity-Based Encryption and Simulatable Oblivious Transfer
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Simulatable Adaptive Oblivious Transfer
• Probability and Computing

This page was built for publication: Efficient Fully-Simulatable Oblivious Transfer