Symmetric Blind Decryption with Perfect Secrecy
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Computer Networks and Communications |
| Online Access: | http://dx.doi.org/10.1155/2017/6575907 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832563567903113216 |
|---|---|
| author | Juha Partala |
| author_facet | Juha Partala |
| author_sort | Juha Partala |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-7dafba0186c14d59ab13b136491a3f21 |
| institution | Kabale University |
| issn | 2090-7141 2090-715X |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Networks and Communications |
| spelling | doaj-art-7dafba0186c14d59ab13b136491a3f212025-02-03T01:13:06ZengWileyJournal of Computer Networks and Communications2090-71412090-715X2017-01-01201710.1155/2017/65759076575907Symmetric Blind Decryption with Perfect SecrecyJuha Partala0Physiological Signal Analysis Team, The Center for Machine Vision and Signal Analysis, University of Oulu, Oulu, FinlandA 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.http://dx.doi.org/10.1155/2017/6575907 |
| spellingShingle | Juha Partala Symmetric Blind Decryption with Perfect Secrecy Journal of Computer Networks and Communications |
| title | Symmetric Blind Decryption with Perfect Secrecy |
| title_full | Symmetric Blind Decryption with Perfect Secrecy |
| title_fullStr | Symmetric Blind Decryption with Perfect Secrecy |
| title_full_unstemmed | Symmetric Blind Decryption with Perfect Secrecy |
| title_short | Symmetric Blind Decryption with Perfect Secrecy |
| title_sort | symmetric blind decryption with perfect secrecy |
| url | http://dx.doi.org/10.1155/2017/6575907 |
| work_keys_str_mv | AT juhapartala symmetricblinddecryptionwithperfectsecrecy |