Knowledge encryption and its applications to simulatable protocols with low round-complexity
From MaRDI portal
Publication:6135438
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
Cites work
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- 3-message zero knowledge against human ignorance
- A Framework for Efficient and Composable Oblivious Transfer
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Advances in Cryptology – CRYPTO 2004
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient oblivious transfer protocols
- Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Foundations of Cryptography
- From weak to strong zero-knowledge and applications
- How to construct constant-round zero-knowledge proof systems for NP
- How to run Turing machines on encrypted data
- Impossibility and Feasibility Results for Zero Knowledge with Public Keys
- Individual simulations
- Oblivious transfer from trapdoor permutations in minimal rounds
- On secure two-party computation in three rounds
- On the Composition of Zero-Knowledge Proof Systems
- On the existence of extractable one-way functions
- Probabilistically Checkable Arguments
- Promise zero knowledge and its applications to round optimal MPC
- Round optimal secure multiparty computation from minimal assumptions
- Round-optimal black-box two-party computation
- Round-optimal secure multi-party computation
- Round-optimal secure two-party computation from trapdoor permutations
- Smooth projective hashing and two-message oblivious transfer
- Statistical Zaps and new oblivious transfer protocols
- Statistical witness indistinguishability (and more) in two messages
- The Exact Round Complexity of Secure Computation
- The Knowledge Complexity of Interactive Proof Systems
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- Two-round oblivious transfer from CDH or LPN
- Weak zero-knowledge beyond the black-box barrier
- Witness encryption and its applications
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
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)
