Abstract
When processing signals in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Comparison of encrypted data however requires an additional protocol between the parties and will be relatively expensive. A well-known and frequently used comparison protocol is by Damgard, Geisler and Kroigaard. We present two ways of improving this comparison protocol. Firstly, we reduce the computational effort of one party by roughly 50%. Secondly, we show how to achieve perfect security towards the other party without additional costs, whereas the original version with encrypted inputs only achieved statistical security. An additional advantage is that larger inputs are allowed.
| Original language | English |
|---|---|
| Title of host publication | 2012 IEEE International Workshop on Information Forensics and Security (WIFS) |
| Place of Publication | Piscataway, NJ |
| Publisher | IEEE |
| Pages | 49-54 |
| Number of pages | 6 |
| ISBN (Electronic) | 978-1-4673-2287-4, 978-1-4673-2286-7 |
| ISBN (Print) | 978-1-4673-2285-0 |
| DOIs | |
| Publication status | Published - 5 Dec 2012 |
| Externally published | Yes |
| Event | IEEE International Workshop on Information Forensics and Security, WIFS 2012 - Tenerife, Spain, Costa Adeje, Spain Duration: 2 Dec 2012 → 5 Dec 2012 |
Conference
| Conference | IEEE International Workshop on Information Forensics and Security, WIFS 2012 |
|---|---|
| Abbreviated title | WIFS 2012 |
| Country/Territory | Spain |
| City | Costa Adeje |
| Period | 2/12/12 → 5/12/12 |
| Other | 2-5 December 2012 |
Keywords
- Protocols
- Computational complexity
- Optimization
- Encryption
- Computational modeling
- n/a OA procedure