Cryptography in the multi-string model

DOI10.1007/s00145-013-9152-yzbMath1302.94050OpenAlexW2025143408MaRDI QIDQ744350

Jens Groth, Rafail Ostrovsky

Publication date: 25 September 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9152-y

zbMATH Keywords

non-interactive zero-knowledgemulti-party computationcommon random string modelmulti-string modeluniversally composable commitment

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (3)

Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Non-malleable time-lock puzzles and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Synthesizers and their application to the parallel construction of pseudo-random functions
• Definitions and properties of zero-knowledge proof systems
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Strengthening zero-knowledge protocols using signatures
• Secure multi-party computation without agreement
• Bringing People of Different Beliefs Together to Do UC
• Universally composable two-party and multi-party secure computation
• Universally Composable Security with Global Setup
• Cryptography in the Multi-string Model
• On the Least Prime in Certain Arithmetic Progressions
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• A Pseudorandom Generator from any One-way Function
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Identity-Based Encryption from the Weil Pairing
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Derandomization in Cryptography
• New Techniques for Noninteractive Zero-Knowledge
• Universally Composable Multi-party Computation with an Unreliable Common Reference String
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Theory of Cryptography

This page was built for publication: Cryptography in the multi-string model