Adaptive Proofs of Knowledge in the Random Oracle Model

DOI10.1007/978-3-662-46447-2_28zbMath1345.94042OpenAlexW590460207MaRDI QIDQ2941213

David Bernhard, Bogdan Warinschi, Marc Fischlin

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46447-2_28

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Naor-Yung paradigm with shared randomness and applications ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Generalized proofs of knowledge with fully dynamic setup ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Naor-Yung Paradigm with Shared Randomness and Applications