Automata, Languages and Programming
From MaRDI portal
Publication:5716830
DOI10.1007/11523468zbMath1084.94513OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716830
Giovanni Di Crescenzo, Ivan Visconti
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (8)
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 ⋮ 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: Automata, Languages and Programming
