On Constant-Round Concurrent Zero-Knowledge

DOI10.1007/978-3-540-78524-8_30MaRDI QIDQ5445525zbMATH OpenOpenAlexFDO

Authors Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Publication date 5 March 2008

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78524-8_30

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On constant-round concurrent zero-knowledge from a knowledge assumption
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Constant-round perfect zero-knowledge computationally convincing protocols
• scientific article; zbMATH DE number 1759795
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Automata, Languages and Programming
• Constant-round concurrent zero knowledge in the bounded player model
• Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
• Concurrent zero knowledge, revisited

Cited in

(21)

• An almost-constant round interactive zero-knowledge proof
• On the security loss of unique signatures
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• On constant-round concurrent non-malleable proof systems
• On the concurrent composition of quantum zero-knowledge
• Concurrent zero knowledge, revisited
• Adaptive hardness and composable security in the plain model from standard assumptions
• On the implausibility of constant-round public-coin zero-knowledge proofs
• On constant-round concurrent zero-knowledge from a knowledge assumption
• Efficient concurrent zero-knowledge in the auxiliary string model
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• scientific article; zbMATH DE number 1418313 (Why is no real title available?)
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• New limits of provable security and applications to ElGamal encryption
• New limits for homomorphic encryption
• Lower bounds for concurrent zero knowledge

This page was built for publication: On Constant-Round Concurrent Zero-Knowledge

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