IEICE TRANSACTIONS on transactions
Several Theorems on Probabilistic Cryptosystems
Summary :
This paper proves several theorems on probabilistic cryptosystems. From these theorems it follows directly that a probabilistic cryptosystem proposed by the authors, whose security is based upon the (supposed) infeasibility of γth-Residuosity Problem, is polynomially secure. Techniques developed in the paper are of independent interest.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E72-E No.7 pp.819-827
- Publication Date
- 1989/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Foundations of Data Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yuliang ZHENG, Tsutomu MATSUMOTO, Hideki IMAI, "Several Theorems on Probabilistic Cryptosystems" in IEICE TRANSACTIONS on transactions,
vol. E72-E, no. 7, pp. 819-827, July 1989, doi: .
Abstract: This paper proves several theorems on probabilistic cryptosystems. From these theorems it follows directly that a probabilistic cryptosystem proposed by the authors, whose security is based upon the (supposed) infeasibility of γth-Residuosity Problem, is polynomially secure. Techniques developed in the paper are of independent interest.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_7_819/_p
Copy
@ARTICLE{e72-e_7_819,
author={Yuliang ZHENG, Tsutomu MATSUMOTO, Hideki IMAI, },
journal={IEICE TRANSACTIONS on transactions},
title={Several Theorems on Probabilistic Cryptosystems},
year={1989},
volume={E72-E},
number={7},
pages={819-827},
abstract={This paper proves several theorems on probabilistic cryptosystems. From these theorems it follows directly that a probabilistic cryptosystem proposed by the authors, whose security is based upon the (supposed) infeasibility of γth-Residuosity Problem, is polynomially secure. Techniques developed in the paper are of independent interest.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Several Theorems on Probabilistic Cryptosystems
T2 - IEICE TRANSACTIONS on transactions
SP - 819
EP - 827
AU - Yuliang ZHENG
AU - Tsutomu MATSUMOTO
AU - Hideki IMAI
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1989
AB - This paper proves several theorems on probabilistic cryptosystems. From these theorems it follows directly that a probabilistic cryptosystem proposed by the authors, whose security is based upon the (supposed) infeasibility of γth-Residuosity Problem, is polynomially secure. Techniques developed in the paper are of independent interest.
ER -
English
