Cryptography in the multi-string model
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 503349 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 2019634 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1405650 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Bit commitment using pseudorandomness
- Bringing people of different beliefs together to do UC
- Cryptography in the Multi-string Model
- Definitions and properties of zero-knowledge proof systems
- Derandomization in Cryptography
- Identity-Based Encryption from the Weil Pairing
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New techniques for noninteractive zero-knowledge
- Noninteractive Zero-Knowledge
- On the Least Prime in Certain Arithmetic Progressions
- Secure multi-party computation without agreement
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Strengthening zero-knowledge protocols using signatures
- Synthesizers and their application to the parallel construction of pseudo-random functions
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Universally Composable Multi-party Computation with an Unreliable Common Reference String
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
Cited in
(8)- Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
- Ramp hyper-invertible matrices and their applications to MPC protocols
- scientific article; zbMATH DE number 2086704 (Why is no real title available?)
- Round-optimal, fully secure distributed key generation
- Cryptography in the Multi-string Model
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Non-malleable time-lock puzzles and applications
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
This page was built for publication: Cryptography in the multi-string model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744350)