scispace - formally typeset
Topic

Public-key cryptography

About: Public-key cryptography is a(n) research topic. Over the lifetime, 27284 publication(s) have been published within this topic receiving 547799 citation(s).

...read more

Papers
More filters

Book ChapterDOI
Adi Shamir1Institutions (1)
23 Aug 1985-
Abstract: In this paper we introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party. The scheme assumes the existence of trusted key generation centers, whose sole purpose is to give each user a personalized smart card when he first joins the network. The information embedded in this card enables the user to sign and encrypt the messages he sends and to decrypt and verify the messages he receives in a totally independent way, regardless of the identity of the other party. Previously issued cards do not have to be updated when new users join the network, and the various centers do not have to coordinate their activities or even to keep a user list. The centers can be closed after all the cards are issued, and the network can continue to function in a completely decentralized way for an indefinite period.

...read more

6,530 citations


Book ChapterDOI
02 May 1999-
TL;DR: A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.

...read more

Abstract: This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.

...read more

6,049 citations



Journal ArticleDOI
Danny Dolev1, Andrew Chi-Chih Yao2Institutions (2)
TL;DR: Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.

...read more

Abstract: Recently the use of public key encryption to provide secure network communication has received considerable attention. Such public key systems are usually effective against passive eavesdroppers, who merely tap the lines and try to decipher the message. It has been pointed out, however, that an improperly designed protocol could be vulnerable to an active saboteur, one who may impersonate another user or alter the message being transmitted. Several models are formulated in which the security of protocols can be discussed precisely. Algorithms and characterizations that can be used to determine protocol security in these models are given.

...read more

4,399 citations


Journal ArticleDOI
David Chaum1Institutions (1)
TL;DR: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system.

...read more

Abstract: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address. The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications. Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms. Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters. Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym, which appears in a roster of acceptable clients.

...read more

3,953 citations


Network Information
Related Topics (5)
Cryptography

37.3K papers, 854.5K citations

96% related
Block cipher

7.2K papers, 163.5K citations

95% related
Message authentication code

5.9K papers, 134.2K citations

95% related
Encryption

98.3K papers, 1.4M citations

94% related
Random oracle

4.4K papers, 174.8K citations

94% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202211
2021928
20201,762
20192,138
20181,833
20171,642

Top Attributes

Show by:

Topic's top 5 most impactful authors

Willy Susilo

115 papers, 5.4K citations

Yi Mu

82 papers, 1.7K citations

Moti Yung

77 papers, 3.6K citations

Goichiro Hanaoka

59 papers, 548 citations

Zhenfu Cao

47 papers, 1K citations