Results 151 to 160 of about 19,193 (189)
Some of the next articles are maybe not open access.
Distributed public key cryptosystems
1998The 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
KETA: Public-key symmetric cryptosystem
2010 4th International Conference on Application of Information and Communication Technologies, 2010The new method of encrypting has been developed. The difference from existing methods is that the identifier of one of the agreed plaintexts (resource files) and the number of the combinatorial permutation of symbols of the indicated resource file is being transmitted, but not the ciphertext. In this connection the developed cryptosystem was named KETA
B. T. Kabulov, N. B. Tashpulatova
openaire +1 more source
Indifferentiability for Public Key Cryptosystems
2020We 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
openaire +1 more source
Protocols for Public Key Cryptosystems
1980 IEEE Symposium on Security and Privacy, 1980New 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
Multivariate Public Key Cryptosystems
2017This paper presents a survey on the multivariate public key cryptosystem (MPKC), which is a public key cryptosystem whose public key is a set of multivariate quadratic forms over a finite field.
openaire +1 more source
Searching for Public-Key Cryptosystems
1984 IEEE Symposium on Security and Privacy, 1984This 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
Finite Automaton Public Key Cryptosystems
2009Since the introduction of the concept of public key cryptosystems by Diffie and Hellman[32], many concrete cryptosystems had been proposed and found applications in the area of information security; almost all are block. In this chapter, we present a sequential one, the so-called finite automaton public key cryptosystem; it can be used for encryption ...
openaire +1 more source
Physical activity counseling in primary care: Insights from public health and behavioral economics
Ca-A Cancer Journal for Clinicians, 2017Kerem Shuval +2 more
exaly