Symmetric Blind Decryption with Perfect Secrecy
Author
Source
Journal of Computer Networks and Communications
Issue
Vol. 2017, Issue 2017 (31 Dec. 2017), pp.1-15, 15 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2017-08-16
Country of Publication
Egypt
No. of Pages
15
Main Subjects
Information Technology and Computer Science
Abstract EN
A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message.
Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages and payment systems.
In terms of functionality, blind decryption is close to oblivious transfer.
For noiseless channels, information-theoretically secure oblivious transfer is impossible.
However, in this paper, we show that this is not the case for blind decryption.
We formulate a definition of perfect secrecy of symmetric blind decryption for the following setting: at most one of the scheme participants is a passive adversary (honest-but-curious).
We also devise a symmetric blind decryption scheme based on modular arithmetic on a ring Zp2, where p is a prime, and show that it satisfies our notion of perfect secrecy.
American Psychological Association (APA)
Partala, Juha. 2017. Symmetric Blind Decryption with Perfect Secrecy. Journal of Computer Networks and Communications،Vol. 2017, no. 2017, pp.1-15.
https://search.emarefa.net/detail/BIM-1173349
Modern Language Association (MLA)
Partala, Juha. Symmetric Blind Decryption with Perfect Secrecy. Journal of Computer Networks and Communications No. 2017 (2017), pp.1-15.
https://search.emarefa.net/detail/BIM-1173349
American Medical Association (AMA)
Partala, Juha. Symmetric Blind Decryption with Perfect Secrecy. Journal of Computer Networks and Communications. 2017. Vol. 2017, no. 2017, pp.1-15.
https://search.emarefa.net/detail/BIM-1173349
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1173349