Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
From MaRDI portal
Publication:4268869
DOI10.1137/S0097539792230010zbMath1018.94015OpenAlexW1995926987MaRDI QIDQ4268869
Dror Lapidot, Adi Shamir, Uriel Feige
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792230010
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)
Related Items
Multi-theorem designated-verifier NIZK for QMA, One-message zero knowledge and non-malleable commitments, Round optimal black-box ``commit-and-prove, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, Does Fiat-Shamir require a cryptographic hash function?, Mercurial commitments with applications to zero-knowledge sets, 3-Message Zero Knowledge Against Human Ignorance, Secure Multiparty RAM Computation in Constant Rounds, Separating Computational and Statistical Differential Privacy in the Client-Server Model, Cryptography with One-Way Communication, On black-box extension of a non-interactive zero-knowledge proof system for secret equality, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Enhancements of trapdoor permutations, Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model, One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model, Non-malleable commitments against quantum attacks, Randomness-efficient non-interactive zero knowledge, Toward non-interactive zero-knowledge proofs for NP from LWE, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Long-term security and universal composability, Round-optimal password-based authenticated key exchange, On server trust in private proxy auctions, Explainable arguments, Round-optimal oblivious transfer and MPC from computational CSIDH, Resumable zero-knowledge for circuits from symmetric key primitives, NIZK from SNARGs, Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract), A Brief History of Provably-Secure Public-Key Encryption, Triply adaptive UC NIZK, Classically verifiable NIZK for QMA with preprocessing, Reverse firewalls for adaptively secure MPC without setup, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Universally composable \(\varSigma \)-protocols in the global random-oracle model, Secure MPC: laziness leads to GOD, Individual simulations, Simulation-sound arguments for LWE and applications to KDM-CCA2 security, Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model, Post-quantum resettably-sound zero knowledge, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, Statistical ZAPs from group-based assumptions, Cryptography and cryptographic protocols, Zero-Knowledge Proofs of Proximity, An Exponential Separation Between MA and AM Proofs of Proximity, An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity, Perfect Non-interactive Zero Knowledge for NP, Verifiable random functions from non-interactive witness-indistinguishable proofs, Simple and generic constructions of succinct functional encryption, Indistinguishability Obfuscation: From Approximate to Exact, A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles, Isolated Proofs of Knowledge and Isolated Zero Knowledge, Cryptography in the multi-string model, Compact designated verifier NIZKs from the CDH assumption without pairings, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, On the power of secure two-party computation, How to extract useful randomness from unreliable sources, Compact NIZKs from standard assumptions on bilinear maps, New constructions of statistical NIZKs: dual-mode DV-NIZKs and more, Non-interactive zero-knowledge in pairing-free groups from weaker assumptions, Statistical ZAPR arguments from bilinear maps, Round-optimal blind signatures in the plain model from classical and quantum standard assumptions, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Towards accountability in CRS generation, Hybrid commitments and their applications to zero-knowledge proof systems, Universally Composable Adaptive Priced Oblivious Transfer, Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge, On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs, Ring signatures: Stronger definitions, and constructions without random oracles, On the Power of Secure Two-Party Computation, On the Existence of Extractable One-Way Functions, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs, 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, Weak Zero-Knowledge beyond the Black-Box Barrier
