Endemic oblivious transfer via random oracles, revisited

DOI10.1007/978-3-031-30545-0_11zbMath1530.94049OpenAlexW4365935833MaRDI QIDQ6178789

Hong-Sheng Zhou, Bingsheng Zhang, Kui Ren, Zhelei Zhou

Publication date: 16 January 2024

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_11

zbMATH Keywords

random oraclesEOT protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``The simplest protocol for oblivious transfer revisited
• Two-round MPC: information-theoretic and black-box
• The wonderful world of global random oracles
• Equational security proofs of oblivious transfer protocols
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• The Simplest Protocol for Oblivious Transfer
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Universally composable two-party and multi-party secure computation
• Universally Composable Security with Global Setup
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• New directions in cryptography
• Universally Composable Synchronous Computation
• Physically Uncloneable Functions in the Universal Composition Framework
• Advances in Cryptology - CRYPTO 2003
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Sublinear Zero-Knowledge Arguments for RAM Programs
• Improved straight-line extraction in the random oracle model with applications to signature aggregation
• GUC-secure commitments via random oracles: new impossibility and feasibility