New Techniques for Noninteractive Zero-Knowledge

DOI10.1145/2220357.2220358zbMath1281.68102OpenAlexW2013686252MaRDI QIDQ5395682

Rafail Ostrovsky, Jens Groth, Amit Sahai

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2220357.2220358

zbMATH Keywords

cryptography universal composability decisional linear assumption witness indistinguishability decision subgroup assumption groups with bilinear map noninteractive zero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (51)

On the round complexity of randomized Byzantine agreement ⋮ One-message zero knowledge and non-malleable commitments ⋮ Certifying trapdoor permutations, revisited ⋮ Separating Computational and Statistical Differential Privacy in the Client-Server Model ⋮ Adaptively secure threshold symmetric-key encryption ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ COA-secure obfuscation and applications ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Witness-succinct universally-composable SNARKs ⋮ A Shuffle Argument Secure in the Generic Model ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Fine-grained verifier NIZK and its applications ⋮ NIZK from SNARGs ⋮ 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) ⋮ Unconditionally secure NIZK in the fine-grained setting ⋮ Triply adaptive UC NIZK ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ NIWI and new notions of extraction for algebraic languages ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Communication complexity of Byzantine agreement, revisited ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Simulation-sound arguments for LWE and applications to KDM-CCA2 security ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Predicate signatures from pair encodings via dual system proof technique ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Cryptography in the multi-string model ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ NIZK from LPN and trapdoor hash via correlation intractability for approximable relations ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

This page was built for publication: New Techniques for Noninteractive Zero-Knowledge