Concurrent and resettable zero-knowledge in poly-logarithmic rounds

DOI10.1145/380752.380851zbMATH Open1317.68076OpenAlexW2075906644MaRDI QIDQ5176014FDOQ5176014

Authors: Joe Kilian, Erez Petrank 

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 1304087
• scientific article; zbMATH DE number 1759795
• scientific article; zbMATH DE number 1775426
• Resettable zero-knowledge (extended abstract)
• On Constant-Round Concurrent Zero-Knowledge

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cites Work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited In (28)

• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Concurrent knowledge extraction in public-key models
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Random walks and concurrent zero-knowledge
• Resettably Secure Computation
• Title not available (Why is that?)
• Possibility and impossibility results for selective decommitments
• Title not available (Why is that?)
• Hybrid commitments and their applications to zero-knowledge proof systems
• Private coins versus public coins in zero-knowledge proof systems
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Improved Zero-Knowledge Identification with Lattices
• Adaptive hardness and composable security in the plain model from standard assumptions
• Magic adversaries versus individual reduction: science wins either way
• Concurrent zero knowledge, revisited
• Lower bounds for non-black-box zero knowledge
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Public-coin parallel zero-knowledge for NP
• On non-black-box simulation and the impossibility of approximate obfuscation
• Resettable zero-knowledge (extended abstract)
• Individual simulations
• On expected polynomial runtime in cryptography
• Post-quantum resettably-sound zero knowledge
• Two-message, oblivious evaluation of cryptographic functionalities
• Non-black-box simulation in the fully concurrent setting, revisited
• Automata, Languages and Programming

This page was built for publication: Concurrent and resettable zero-knowledge in poly-logarithmic rounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176014)