On the Security of Schnorr Signatures, DSA, and ElGamal Signatures against Related-Key Attacks

2017 ◽  
Vol E100.A (1) ◽  
pp. 73-90 ◽  
Author(s):  
Hiraku MORITA ◽  
Jacob C.N. SCHULDT ◽  
Takahiro MATSUDA ◽  
Goichiro HANAOKA ◽  
Tetsu IWATA
Keyword(s):  
Schnorr Signatures

scholarly journals A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1330
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Key Management ◽  
Discrete Logarithm ◽  
Probability Bounds ◽  
Diffie Hellman ◽  
Identity Based ◽  
Symmetric Key ◽  
Security Guarantees ◽  
Lightweight Authentication ◽  
Tight Security ◽  
Schnorr Signatures

The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction is considered tight if it results in approximately similar probability bounds to that of solving the underlying hard assumption. Tight security is desirable as it improves security guarantees and allows the use of shorter parameters without the risk of compromising security. In this work, we propose an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures. The proposed IBI scheme enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Our scheme is suitable to be used for lightweight authentication in resource-constrained Wireless Sensor Networks (WSNs) as it utilizes the lowest amount of bandwidth when compared to other state-of-the-art symmetric key lightweight authentication schemes. Although it is costlier than its symmetric key counterparts in terms of operational costs due to its asymmetric key nature, it enjoys other benefits such as decentralized authentication and scalable key management. As a proof of concept to substantiate our claims, we perform an implementation of our scheme to demonstrate its speed and memory usage when it runs on both high and low-end devices.

scholarly journals Hash function requirements for Schnorr signatures

2009 ◽  
Vol 3 (1) ◽  
Author(s):  
Gregory Neven ◽  
Nigel P. Smart ◽  
Bogdan Warinschi
Keyword(s):  
Hash Function ◽  
Schnorr Signatures

Reusing Nonces in Schnorr Signatures

2017 ◽  
pp. 224-241
Author(s):  
Marc Beunardeau ◽  
Aisling Connolly ◽  
Houda Ferradi ◽  
Rémi Géraud ◽  
David Naccache ◽  
...  
Keyword(s):  
Schnorr Signatures

scholarly journals On Tight Security Proofs for Schnorr Signatures

2019 ◽  
Vol 32 (2) ◽  
pp. 566-599 ◽  
Author(s):  
Nils Fleischhacker ◽  
Tibor Jager ◽  
Dominique Schröder
Keyword(s):  
Security Proofs ◽  
Tight Security ◽  
Schnorr Signatures
Sign in / Sign up

Export Citation Format

Share Document