Symmetric blind decryption with perfect secrecy
1Physiological Signal Analysis Team, The Center for Machine Vision and Signal Analysis, University of Oulu
|Online Access:||PDF Full Text (PDF, 1.7 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2017101150052
|Publish Date:|| 2017-10-11
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 Z𝑝2, where is a prime, and show that it satisfies our notion of perfect secrecy.
Journal of computer networks and communications
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
113 Computer and information sciences
Financial support from Infotech Oulu Graduate School and the following foundations is gratefully acknowledged: Finnish Foundation for Technology Promotion, the Nokia Foundation, Tauno Tönning Foundation, Walter Ahsltröm Foundation, and the Finnish Foundation for Economic and Technology Sciences (KAUTE).
Copyright © 2017 Juha Partala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.