A new aspect for security notions: Secure randomness in public-key encryption schemes

Takeshi Koshiba

A new aspect for security notions: Secure randomness in public-key encryption schemes

Takeshi Koshiba^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.

Original language	English
Title of host publication	Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings
Publisher	Springer Verlag
Pages	87-103
Number of pages	17
Volume	1992
ISBN (Electronic)	3540416587, 9783540416586
Publication status	Published - 2001
Externally published	Yes
Event	4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 - Cheju Island, Korea, Republic of Duration: 2001 Feb 13 → 2001 Feb 15

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1992
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001
Country/Territory	Korea, Republic of
City	Cheju Island
Period	01/2/13 → 01/2/15

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Cite this

Koshiba, T. (2001). A new aspect for security notions: Secure randomness in public-key encryption schemes. In Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings (Vol. 1992, pp. 87-103). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1992). Springer Verlag.

A new aspect for security notions: Secure randomness in public-key encryption schemes. / Koshiba, Takeshi.
Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings. Vol. 1992 Springer Verlag, 2001. p. 87-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1992).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Koshiba, T 2001, A new aspect for security notions: Secure randomness in public-key encryption schemes. in Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings. vol. 1992, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1992, Springer Verlag, pp. 87-103, 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Cheju Island, Korea, Republic of, 01/2/13.

Koshiba T. A new aspect for security notions: Secure randomness in public-key encryption schemes. In Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings. Vol. 1992. Springer Verlag. 2001. p. 87-103. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Koshiba, Takeshi. / A new aspect for security notions : Secure randomness in public-key encryption schemes. Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings. Vol. 1992 Springer Verlag, 2001. pp. 87-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6d28a68d725342ef9f1d47260cee9686,

title = "A new aspect for security notions: Secure randomness in public-key encryption schemes",

abstract = "In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.",

author = "Takeshi Koshiba",

year = "2001",

language = "English",

volume = "1992",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "87--103",

booktitle = "Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings",

address = "Germany",

note = "4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 ; Conference date: 13-02-2001 Through 15-02-2001",

}

TY - GEN

T1 - A new aspect for security notions

T2 - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001

AU - Koshiba, Takeshi

PY - 2001

Y1 - 2001

N2 - In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.

AB - In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.

UR - http://www.scopus.com/inward/record.url?scp=84937425036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937425036&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84937425036

VL - 1992

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 87

EP - 103

BT - Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings

PB - Springer Verlag

Y2 - 13 February 2001 through 15 February 2001

ER -

A new aspect for security notions: Secure randomness in public-key encryption schemes

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this