Black-box non-black-box zero knowledge
From MaRDI portal
Publication:5259587
DOI10.1145/2591796.2591879zbMATH Open1315.94077OpenAlexW2094644515MaRDI QIDQ5259587FDOQ5259587
Authors: Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti 
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591879
Recommendations
- Round optimal black-box ``commit-and-prove
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Round-optimal black-box commit-and-prove with succinct communication
- Non-black-box simulation in the fully concurrent setting
Cites Work
- Theory of Cryptography
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower bounds in differential privacy
- Iterative Constructions and Private Data Release
- Differential privacy and the fat-shattering dimension of linear queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the sample complexity for private learning and private data release
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (21)
- Black-box anonymous commit-and-prove
- Sublinear zero-knowledge arguments for RAM programs
- Succinct arguments for RAM programs via projection codes
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Round optimal black-box ``commit-and-prove
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir for highly sound protocols is instantiable
- Round-optimal black-box commit-and-prove with succinct communication
- Improved, black-box, non-malleable encryption from semantic security
- Secure multiparty RAM computation in constant rounds
- Interactive oracle proofs
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- On the Power of Secure Two-Party Computation
- A coin-free oracle-based augmented black box framework
- Bounded size-hiding private set intersection
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Black-box (and fast) non-malleable zero knowledge
- On the power of secure two-party computation
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- A black-box construction of non-malleable encryption from semantically secure encryption
Uses Software
This page was built for publication: Black-box non-black-box zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259587)
