Short Undeniable Signatures Without Random Oracles: The Missing Link (original) (raw)
Related papers
A Signature Scheme as Secure as the Diffie-Hellman Problem
Lecture Notes in Computer Science, 2003
A New Signature Scheme without Random Oracles and Its Applications
2008
A Short Certificate-based Signature Scheme with Provable Security
Information Technology And Control, 2016
(Convertible) undeniable signatures without random oracles
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007
Identity Based Undeniable Signatures
Lecture Notes in Computer Science, 2004
Signatures Without Random Oracles or Non-Black Box Assumptions
2006
Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems
Journal of Cryptology, 2007
International Journal of Information Security, 2011
Practical group signatures without random oracles
2005
Get Shorty via Group Signatures without Encryption
Lecture Notes in Computer Science, 2010
Efficient Strongly Unforgeable ID-Based Signature Without Random Oracles
INFORMATICA,, 2014
A New Short Signature Scheme Without Random Oracles from Bilinear Pairings
International Conferenceon Cryptology in Vietnam, 2005
Security of verifiably encrypted signatures and a construction without random oracles
Pairing-Based CryptographyPairing 2009, 2009
Provably Secure Convertible Undeniable Signatures with Unambiguity
Lecture Notes in Computer Science, 2010
Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
2005
Anonymous Signatures Revisited
Lecture Notes in Computer Science, 2009
Certificateless Signature with Strong Unforgeability in the Standard Model
Informatica, 2015
Formalizing Group Blind Signatures and Practical Constructions without Random Oracles
Practical fair anonymous undeniable signatures
2004
2021
Cryptanalysis of the Lee-Hwang Group-Oriented Undeniable Signature Schemes
2002
A Strongly Secure Certificateless Digital Signature Scheme in the Random Oracle Model
2016
Designated verifier signature schemes: Attacks, new security notions and a new construction
Automata, Languages and Programming, 2005
2021
A zero-knowledge undeniable signature scheme in non-abelian group setting
International Journal of Network Security, 2008
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Lecture Notes in Computer Science, 2010
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Lecture Notes in Computer Science, 2004
Universal Designated-Verifier Signatures
2003
A New Signature Scheme Without Random Oracles from Bilinear Pairings
Progress in Cryptology - VIETCRYPT 2006, 2006
Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample
Lecture Notes in Computer Science, 2017
Provable Secure Identity Based Signcryption Schemes without Random Oracles
International Journal of Network Security & Its Applications, 2012
Provably Secure Identity-Based Aggregate Signature Scheme
2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2012
Tightly-Secure Signatures from Lossy Identification Schemes
Advances in Cryptology – EUROCRYPT 2012, 2012