Semi-honest to Malicious Oblivious Transfer—The Black-Box Way

DOI10.1007/978-3-540-78524-8_23zbMath1162.94362OpenAlexW1548159703MaRDI QIDQ5445518

Iftach Haitner

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_23

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Round optimal black-box ``commit-and-prove, Towards a unified approach to black-box constructions of zero-knowledge proofs, Round-Optimal Black-Box Two-Party Computation, A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round, Round-efficient black-box construction of composable multi-party computation, A black-box construction of non-malleable encryption from semantically secure encryption, What security can we achieve within 4 rounds?, Weak Oblivious Transfer from Strong One-Way Functions, Network Oblivious Transfer, On black-box complexity of universally composable security in the CRS model, The Limits of Common Coins: Further Results, Public-Key Cryptographic Primitives Provably as Secure as Subset Sum, Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols, The price of active security in cryptographic protocols

Cites Work

• Bit commitment using pseudorandomness
• A simpler construction of CCA2-secure public-key encryption under general assumptions
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Black-box constructions for secure computation
• On the Reversibility of Oblivious Transfer
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Nonmalleable Cryptography
• Foundations of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item