Zaps and Their Applications
From MaRDI portal
Publication:5432360
DOI10.1137/S0097539703426817zbMath1125.94019OpenAlexW2132951912MaRDI QIDQ5432360
Publication date: 3 January 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539703426817
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (72)
Compact ring signatures from learning with errors ⋮ One-message zero knowledge and non-malleable commitments ⋮ Certifying trapdoor permutations, revisited ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ The Journey from NP to TFNP Hardness ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ A note on the Dwork-Naor timed deniable authentication ⋮ Separating Computational and Statistical Differential Privacy in the Client-Server Model ⋮ A note on perfect correctness by derandomization ⋮ Unconditionally anonymous ring and mesh signatures ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ 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 ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Explainable arguments ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Collision-resistance from multi-collision-resistance ⋮ NIZK from SNARGs ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Statistical security in two-party computation revisited ⋮ Unconditionally secure NIZK in the fine-grained setting ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Updatable NIZKs from non-interactive zaps ⋮ Universal reductions: reductions relative to stateful oracles ⋮ More efficient verifiable functional encryption ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ On constant-round concurrent non-malleable proof systems ⋮ The hunting of the SNARK ⋮ Reusable secure computation in the plain model ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Secure MPC: laziness leads to GOD ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Statistical ZAPs from group-based assumptions ⋮ (2+\(f\)(\(n\)))-SAT and its properties. ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Predictable Arguments of Knowledge ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Lower bounds for non-black-box zero knowledge ⋮ Limits of Constructive Security Proofs ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Collision Resistance from Multi-collision Resistance ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Round-optimal secure multi-party computation ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Weak zero-knowledge via the Goldreich-Levin theorem ⋮ Concurrently secure blind Schnorr signatures ⋮ NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness ⋮ Resettably Secure Computation ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ How to extract useful randomness from unreliable sources ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Towards accountability in CRS generation ⋮ On the Existence of Extractable One-Way Functions ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ A Note on Perfect Correctness by Derandomization ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
This page was built for publication: Zaps and Their Applications
