On Tight Security Proofs for Schnorr Signatures

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-662-45611-8_27

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

GQ and Schnorr Identification Schemes: Proofs of Security Against Impersonation Under Active and Concurrent Attacks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Tagged One-Time Signatures: Tight Security and Optimal Tag Size

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Concise Multi-Challenge CCA-Secure Encryption and Signatures With Almost Tight Security

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Modular Security Proofs for Key Agreement Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Interpreting Hash Function Security Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Computer-Aided Security Proofs for the Working Cryptographer

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Optimal Security Proofs for PSS and Other Signature Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Security of Blind Signatures Revisited

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy