scispace - formally typeset

Schnorr signature

About: Schnorr signature is a(n) research topic. Over the lifetime, 2026 publication(s) have been published within this topic receiving 101107 citation(s). more


Open accessJournal ArticleDOI: 10.1145/357980.358017
Abstract: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n. more

Topics: Encryption (66%), Attribute-based encryption (62%), Key (cryptography) (62%) more

14,611 Citations

Journal ArticleDOI: 10.1109/TIT.1976.1055638
Whitfield Diffie1, Martin E. Hellman1Institutions (1)
Abstract: Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. more

Topics: Financial cryptography (60%), Strong cryptography (59%), Key exchange (58%) more

14,068 Citations

Proceedings ArticleDOI: 10.1145/168588.168596
Mihir Bellare1, Phillip Rogaway1Institutions (1)
01 Dec 1993-
Abstract: We argue that the random oracle model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol PR for the random oracle model, and then replacing oracle accesses by the computation of an “appropriately chosen” function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including encryption, signatures, and zero-knowledge proofs. more

Topics: Random oracle (67%), Pseudorandom function family (64%), Random function (63%) more

4,977 Citations

Open accessBook ChapterDOI: 10.1007/3-540-47721-7_12
Amos Fiat1, Adi Shamir1Institutions (1)
01 Jan 1987-
Abstract: In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems. more

Topics: Strong RSA assumption (58%), Ring signature (57%), Schnorr signature (56%) more

3,737 Citations

Open accessBook ChapterDOI: 10.1007/3-540-45682-1_30
Dan Boneh1, Ben Lynn1, Hovav Shacham1Institutions (1)
09 Dec 2001-
Abstract: We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel. more

Topics: Ring signature (68%), Merkle signature scheme (64%), Schnorr signature (63%) more

3,312 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

Willy Susilo

31 papers, 1.6K citations

Yi Mu

26 papers, 782 citations

Zhenfu Cao

19 papers, 240 citations

Fangguo Zhang

16 papers, 462 citations

Duncan S. Wong

14 papers, 314 citations

Network Information
Related Topics (5)

8.4K papers, 233.2K citations

87% related
Public-key cryptography

27.2K papers, 547.7K citations

87% related
Probabilistic encryption

6.4K papers, 208.9K citations

86% related
Digital signature

10.9K papers, 233.8K citations

86% related
Block cipher

7.2K papers, 163.5K citations

86% related