Efficient Zero Knowledge on the Internet

DOI10.1007/11787006_3MaRDI QIDQ3591408zbMATH OpenOpenAlexFDO

Authors Ivan Visconti

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_3

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 1775426
• Concurrent zero-knowledge
• scientific article; zbMATH DE number 2009953
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

Cited in

(12)

• Hybrid commitments and their applications to zero-knowledge proof systems
• Concurrent knowledge extraction in public-key models
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Improved OR-composition of sigma-protocols
• Optimistic concurrent zero knowledge
• Efficient concurrent zero-knowledge in the auxiliary string model
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Co-sound Zero-Knowledge with Public Keys
• scientific article; zbMATH DE number 2009953 (Why is no real title available?)
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

This page was built for publication: Efficient Zero Knowledge on the Internet

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