A Survey of Public-Key Cryptosystems

Koblitz, Neal; Menezes, Alfred

doi:10.1137/s0036144503439190

Cited by 41 publications

(29 citation statements)

References 104 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the heart of this concept is the idea of using a one-way function for encryption (see the survey paper of Koblitz and Menezes [73]). …”

Section: What Is Public-key Cryptography?mentioning

confidence: 99%

“…The idea of public-key cryptography in general is to make it possible for two parties to agree on a shared secret key, which they can use to transfer data in a secure way (see [73]). There are several known public-key cryptosystems which are based on the discrete logarithm problem, which is the problem of finding x in the equation g x = h where g, h are given, and on the factorization problem, which is the problem of factoring a number to its prime factors: DiffieHellman [38] and RSA [106].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Braid Group Cryptography

Garber

2009

Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore

View full text Add to dashboard Cite

In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them.This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryptosystems based on the braid group, and some of the known attacks on these cryptosystems. We conclude with a discussion of future directions (which includes also a description of cryptosystems which are based on other non-commutative groups).

show abstract

“…At the heart of this concept is the idea of using a one-way function for encryption (see the survey paper of Koblitz and Menezes [73]). …”

Section: What Is Public-key Cryptography?mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Braid Group Cryptography

Garber

2009

Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore

View full text Add to dashboard Cite

show abstract

“…Recently, it is shown that cryptosystem proved secure in the traditional model may not resist the side-channel attacks [6] which can recover a fraction of the secret key to the adversary. To protect against above realistic attacks in the provable security approach, one can model them using abstract notions of computation which leads to many studies made in leakage-resilient cryptography.…”

Section: Introductionmentioning

confidence: 99%

Anonymous Identity-Based Encryption with Bounded Leakage Resilience

Liu

Guo

et al. 2015

2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

Memory attacks, inspired by recent realistic physical attacks, have broken many cryptographic schemes which were considered secure. In this paper, we consider the memory leakage resilience in anonymous identity-based encryption schemes. We construct a leakage-resilient anonymous identitybased encryption scheme based on dual system encryption. Inspired by Lewko et al.'s techniques, our scheme is built in composite order groups which have four prime order subgroups and blind the public parameters and ciphertexts using the random elements of same subgroup to achieve the anonymity. Moreover, we analyze the security of our scheme in the full adaptive-ID model rather than the selective-ID model.

show abstract

“…The algorithm is known as DSA, for Digital Signature Algorithm [13,12,10]. It is an efficient variant of the ElGamal digital signature scheme [4] intended for use in electronic mail, electronic funds transfer, electronic data interchange, software distribution, data storage, and other applications which require data integrity assurance and data authentication.…”

Section: Introductionmentioning

confidence: 99%

“…It is an efficient variant of the ElGamal digital signature scheme [4] intended for use in electronic mail, electronic funds transfer, electronic data interchange, software distribution, data storage, and other applications which require data integrity assurance and data authentication. In 1998, an elliptic curve analogue called Elliptic Curve Digital Signature Algorithm (ECDSA) was proposed and standardized [5,9,10].…”

Section: Introductionmentioning

confidence: 99%