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

DOI10.1007/978-3-031-22969-5_12zbMATH Open1519.94102MaRDI QIDQ6135438FDOQ6135438

Authors: Yi Deng 

Publication date: 25 August 2023

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

Recommendations

• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Distinguisher-dependent simulation in two rounds and its applications
• Efficient Fully-Simulatable Oblivious Transfer
• Efficient fully-simulatable oblivious transfer
• Improved non-committing encryption with applications to adaptively secure protocols

zbMATH Keywords

knowledge encryptionthree-round (weakly) simulatable oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• How to construct constant-round zero-knowledge proof systems for NP
• Efficient oblivious transfer protocols
• Title not available (Why is that?)
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• A Framework for Efficient and Composable Oblivious Transfer
• The Knowledge Complexity of Interactive Proof Systems
• Advances in Cryptology – CRYPTO 2004
• Probabilistically Checkable Arguments
• Smooth projective hashing and two-message oblivious transfer
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to run Turing machines on encrypted data
• The Exact Round Complexity of Secure Computation
• Witness encryption and its applications
• Title not available (Why is that?)
• 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
• Round-optimal secure two-party computation from trapdoor permutations
• Promise zero knowledge and its applications to round optimal MPC
• (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• Round-optimal black-box two-party computation
• Round-optimal secure multi-party computation
• Round optimal secure multiparty computation from minimal assumptions
• On secure two-party computation in three rounds
• On the existence of extractable one-way functions
• From weak to strong zero-knowledge and applications
• Statistical Zaps and new oblivious transfer protocols
• Two-round oblivious transfer from CDH or LPN
• 3-message zero knowledge against human ignorance
• Weak zero-knowledge beyond the black-box barrier
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Oblivious transfer from trapdoor permutations in minimal rounds
• Individual simulations
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135438)