Results 181 to 190 of about 3,960 (217)

Indifferentiability for Public Key Cryptosystems

2020
We initiate the study of indifferentiability for public key encryption and other public key primitives. Our main results are definitions and constructions of public key cryptosystems that are indifferentiable from ideal cryptosystems, in the random oracle model.
Mark Zhandry, Cong Zhang 0001
openaire   +2 more sources

Quantum Public-Key Cryptosystem

International Journal of Theoretical Physics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luo, Ming-Xing, Chen, Xiu-Bo, Yun, Deng, Yang, Yi-Xian   +3 more
openaire   +1 more source

Quaternion public key cryptosystems

2016 World Congress on Industrial Control Systems Security (WCICSS), 2016
In this paper, quaternion key exchange protocol and quaternion public key encryption scheme are proposed. The security of proposals relies on hardness of the hidden quaternion conjugacy search problem, that is, difficulty of solving the simultaneous quaternion discrete logarithmic problem and quaternion conjugacy search problem over quaternion rings ...
Maheswara Rao Valluri, Shailendra Vikash Narayan   +1 more
openaire   +1 more source

Complexity Measures for Public-Key Cryptosystems

SIAM Journal on Computing, 1988
A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two related approaches are taken to the development of this theory, and these approaches correspond to different but equivalent formulations of the problem of cracking a public-key cryptosystem (PKCS).
Joachim Grollmann, Alan L. Selman
openaire   +2 more sources

Protocols for Public Key Cryptosystems

1980 IEEE Symposium on Security and Privacy, 1980
New Cryptographic protocols which take full advantage of the unique properties of public key cryptosystems are now evolving. Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative.
openaire   +1 more source

Searching for Public-Key Cryptosystems

1984 IEEE Symposium on Security and Privacy, 1984
This article suggests the use of undecidable problems in constructing public-key cryptosystems. Any such system must still be in NP, but intuitive arguments suggest that this approach might be a reasonable alternative to the use of NP-complete problems.
openaire   +1 more source

Coalition Public-Key Cryptosystems

Cybernetics and Systems Analysis, 2001
A coalition is understood to be a group of participants (coalitionists) who can collaborate in order to achieve common objectives. The basic principle of a coalition is the absence of a threat to communication flows within the coalition from its participants. In this paper, two new RSA coalition protocols are considered. According to the first protocol,
openaire   +1 more source

Distributed public key cryptosystems

1998
The cryptographic community has developed many tools to incorporate distributed trust mechanisms into cryptographic primitives and protocols as well as primitives where parties are naturally distributed. Since the fastest growing paradigm in computing is distributed systems and communication networks, the importance of distributed mechanisms has been ...
Yair Frankel, Moti Yung
openaire   +1 more source

Key Privacy in McEliece Public Key Cryptosystem

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, 2011
the research on the anonymity of original McEliece PKC points out that the original McEliece PKC fails to hold the property of key privacy. A novel semantically secure variant of McEliece PKC is proposed, and proved its anonymity formally in standard model.
Qiang Wang 0020, Xue Qiu, Quan Zhang, Chaojing Tang   +3 more
openaire   +1 more source

Cryptanalysis of the WD public-key cryptosystem

First International Symposium on Cyber Worlds, 2002. Proceedings., 2003
The theory of generalized inverses of matrices over finite fields has been used in cryptographic applications in recent years. Wu and Dawson (1998) proposed a public-key cryptosystem based on generalized inverses of matrices. In 2001, Sun proposed a scheme for cryptanalysing Wu and Dawson's public-key cryptosystem. However, his method is time intensive
Hui-Feng Huang, Chin-Chen Chang 0001
openaire   +1 more source