Black-box non-black-box zero knowledge
From MaRDI portal
Publication:5259587
DOI10.1145/2591796.2591879zbMath1315.94077OpenAlexW2094644515MaRDI QIDQ5259587
Alessandra Scafuro, Ivan Visconti, Vipul Goyal, Rafail Ostrovsky
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
Related Items
Round optimal black-box ``commit-and-prove, Towards a unified approach to black-box constructions of zero-knowledge proofs, Fiat-Shamir for highly sound protocols is instantiable, Secure Multiparty RAM Computation in Constant Rounds, Interactive Oracle Proofs, Improved, black-box, non-malleable encryption from semantic security, Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round, Succinct arguments for RAM programs via projection codes, A black-box construction of non-malleable encryption from semantically secure encryption, Sublinear Zero-Knowledge Arguments for RAM Programs, On the power of secure two-party computation, Fiat–Shamir for Highly Sound Protocols Is Instantiable, Bounded Size-Hiding Private Set Intersection, On the Power of Secure Two-Party Computation, Round-optimal black-box commit-and-prove with succinct communication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- 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
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography