Automata, Languages and Programming
From MaRDI portal
Publication:5716783
DOI10.1007/11523468zbMath1082.94012OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716783
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
Related Items (8)
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Somewhere statistically binding commitment schemes with applications ⋮ On constant-round concurrent non-malleable proof systems ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval 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 ⋮ Hybrid commitments and their applications to zero-knowledge proof systems
This page was built for publication: Automata, Languages and Programming
