Knowledge encryption and its applications to simulatable protocols with low round-complexity

DOI10.1007/978-3-031-22969-5_12zbMath1519.94102MaRDI QIDQ6135438

Yi Deng, Unnamed Author

Publication date: 25 August 2023

Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

zbMATH Keywords

knowledge encryptionthree-round (weakly) simulatable oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Two-message statistically sender-private OT from LWE
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Statistical witness indistinguishability (and more) in two messages
• Distinguisher-dependent simulation in two rounds and its applications
• On secure two-party computation in three rounds
• Round-optimal secure two-party computation from trapdoor permutations
• Promise zero knowledge and its applications to round optimal MPC
• How to construct constant-round zero-knowledge proof systems for NP
• Statistical Zaps and new oblivious transfer protocols
• Two-round oblivious transfer from CDH or LPN
• Round optimal secure multiparty computation from minimal assumptions
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Individual simulations
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• Oblivious transfer from trapdoor permutations in minimal rounds
• How to Run Turing Machines on Encrypted Data
• (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
• 3-Message Zero Knowledge Against Human Ignorance
• Probabilistically Checkable Arguments
• Round-Optimal Black-Box Two-Party Computation
• A Framework for Efficient and Composable Oblivious Transfer
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
• Weak zero-knowledge beyond the black-box barrier
• On the existence of extractable one-way functions
• From Weak to Strong Zero-Knowledge and Applications
• Advances in Cryptology – CRYPTO 2004
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• Witness encryption and its applications
• The Exact Round Complexity of Secure Computation
• Round-optimal secure multi-party computation

This page was built for publication: Knowledge encryption and its applications to simulatable protocols with low round-complexity