An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

Ran Canetti

doi:10.1007/3-540-48910-X_7

An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

Ran Canetti

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

132 Scopus citations

Abstract

This paper proposes a simple threshold Public-Key Cryp- tosystem (PKC) which is secure against adaptive chosen ciphertext at- tack, under the Decisional Diffie-Hellman (DDH) intractability assumption. Previously, it was shown how to design non-interactive threshold PKC secure under chosen ciphertext attack, in the random-oracle model and under the DDH intractability assumption [25]. The random-oracle was used both in the proof of security and to eliminate interaction. General completeness results for multi-party computations [6,13] enable in principle converting any single server PKC secure against CCA (e.g., [19,17]) into a threshold one, but the conversions are inefficient and require much interaction among the servers for each ciphertext decrypted. The recent work by Cramer and Shoup [17] on single server PKC secure against adaptive CCA is the starting point for the new proposal.

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Jacques Stern
Publisher	Springer Verlag
Pages	90-106
Number of pages	17
ISBN (Print)	3540658890, 9783540658894
DOIs	https://doi.org/10.1007/3-540-48910-X_7
State	Published - 1999
Externally published	Yes
Event	7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999 - Prague, Czech Republic Duration: 2 May 1999 → 6 May 1999

Publication series

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

Conference

Conference	7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999
Country/Territory	Czech Republic
City	Prague
Period	2/05/99 → 6/05/99

Access to Document

10.1007/3-540-48910-X_7

Cite this

Canetti, R. (1999). An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In J. Stern (Ed.), Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 90-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1592). Springer Verlag. https://doi.org/10.1007/3-540-48910-X_7

Canetti, Ran. / An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Jacques Stern. Springer Verlag, 1999. pp. 90-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{083c7021317b4bf2a573468a0bafb767,

title = "An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack",

abstract = "This paper proposes a simple threshold Public-Key Cryp- tosystem (PKC) which is secure against adaptive chosen ciphertext at- tack, under the Decisional Diffie-Hellman (DDH) intractability assumption. Previously, it was shown how to design non-interactive threshold PKC secure under chosen ciphertext attack, in the random-oracle model and under the DDH intractability assumption [25]. The random-oracle was used both in the proof of security and to eliminate interaction. General completeness results for multi-party computations [6,13] enable in principle converting any single server PKC secure against CCA (e.g., [19,17]) into a threshold one, but the conversions are inefficient and require much interaction among the servers for each ciphertext decrypted. The recent work by Cramer and Shoup [17] on single server PKC secure against adaptive CCA is the starting point for the new proposal.",

author = "Ran Canetti",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999 ; Conference date: 02-05-1999 Through 06-05-1999",

year = "1999",

doi = "10.1007/3-540-48910-X_7",

language = "אנגלית",

isbn = "3540658890",

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

publisher = "Springer Verlag",

pages = "90--106",

editor = "Jacques Stern",

booktitle = "Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",

address = "גרמניה",

}

Canetti, R 1999, An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. in J Stern (ed.), Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1592, Springer Verlag, pp. 90-106, 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999, Prague, Czech Republic, 2/05/99. https://doi.org/10.1007/3-540-48910-X_7

An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. / Canetti, Ran.
Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Jacques Stern. Springer Verlag, 1999. p. 90-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1592).

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

TY - GEN

T1 - An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

AU - Canetti, Ran

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - This paper proposes a simple threshold Public-Key Cryp- tosystem (PKC) which is secure against adaptive chosen ciphertext at- tack, under the Decisional Diffie-Hellman (DDH) intractability assumption. Previously, it was shown how to design non-interactive threshold PKC secure under chosen ciphertext attack, in the random-oracle model and under the DDH intractability assumption [25]. The random-oracle was used both in the proof of security and to eliminate interaction. General completeness results for multi-party computations [6,13] enable in principle converting any single server PKC secure against CCA (e.g., [19,17]) into a threshold one, but the conversions are inefficient and require much interaction among the servers for each ciphertext decrypted. The recent work by Cramer and Shoup [17] on single server PKC secure against adaptive CCA is the starting point for the new proposal.

AB - This paper proposes a simple threshold Public-Key Cryp- tosystem (PKC) which is secure against adaptive chosen ciphertext at- tack, under the Decisional Diffie-Hellman (DDH) intractability assumption. Previously, it was shown how to design non-interactive threshold PKC secure under chosen ciphertext attack, in the random-oracle model and under the DDH intractability assumption [25]. The random-oracle was used both in the proof of security and to eliminate interaction. General completeness results for multi-party computations [6,13] enable in principle converting any single server PKC secure against CCA (e.g., [19,17]) into a threshold one, but the conversions are inefficient and require much interaction among the servers for each ciphertext decrypted. The recent work by Cramer and Shoup [17] on single server PKC secure against adaptive CCA is the starting point for the new proposal.

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

U2 - 10.1007/3-540-48910-X_7

DO - 10.1007/3-540-48910-X_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957712291

SN - 3540658890

SN - 9783540658894

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

SP - 90

EP - 106

BT - Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - Stern, Jacques

PB - Springer Verlag

T2 - 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999

Y2 - 2 May 1999 through 6 May 1999

ER -

Canetti R. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In Stern J, editor, Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 1999. p. 90-106. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48910-X_7

An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this