Abstract
When processing signals in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Integer division of encrypted data however requires an additional protocol with the server and will be relatively expensive. We present new solutions for dividing encrypted data, having low computational complexity. Two protocols for computing exact division, and two for approximating the division result.
| Original language | English |
|---|---|
| Title of host publication | 2010 IEEE International Workshop on Information Forensics and Security |
| Place of Publication | Piscataway, NJ |
| Publisher | IEEE |
| Pages | 1-6 |
| Number of pages | 6 |
| ISBN (Electronic) | 978-1-4244-9080-6 |
| ISBN (Print) | 978-1-4244-9079-0 (CD), 978-1-4244-9078-3 |
| DOIs | |
| Publication status | Published - 15 Dec 2010 |
| Externally published | Yes |
| Event | 2010 IEEE International Workshop on Information Forensics and Security - Seattle, United States Duration: 12 Dec 2010 → 15 Dec 2010 |
Workshop
| Workshop | 2010 IEEE International Workshop on Information Forensics and Security |
|---|---|
| Country/Territory | United States |
| City | Seattle |
| Period | 12/12/10 → 15/12/10 |
Keywords
- Protocols
- Encryption
- Approximation methods
- Computational complexity
- Indexes
- n/a OA procedure