Efficient Zero Knowledge on the Internet

DOI10.1007/11787006_3zbMath1133.68301OpenAlexW1489546260MaRDI QIDQ3591408

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)

Related Items (9)

Concurrent knowledge extraction in public-key models ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Co-sound Zero-Knowledge with Public Keys ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge

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