Paper 2005/378
A New Protocol for Conditional Disclosure of Secrets And Its Applications
Sven Laur and Helger Lipmaa
Abstract
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range
Note: The main results of this paper (the new DIE protocol, CDS protocol, CDS transformation) date from August 2004. First eprint version (20.10.2005) was a delibrately old version from May 2005. Second eprint version (21.11.2005): better readability, more applications, more general. Third eprint version (08.08.2006): this version has better readability. The most important additions: the use of Elliptic Curve Method of factoring to achieve additional security, and the unified explanation of several protocols by using a forked compostion together with a communication-efficient CPIR, see Thm 2. Fourth eprint version (March 2007): corresponds to the published version. No new contents, better readability.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. ACNS 2007
- Keywords
- Conditional disclosure of secretscrypto-computinghomomorphic encryptionoblivious transfertwo-party computation
- Contact author(s)
- h lipmaa @ cs ucl ac uk
- History
- 2007-03-20: last of 6 revisions
- 2005-10-23: received
- See all versions
- Short URL
- https://ia.cr/2005/378
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/378, author = {Sven Laur and Helger Lipmaa}, title = {A New Protocol for Conditional Disclosure of Secrets And Its Applications}, howpublished = {Cryptology {ePrint} Archive, Paper 2005/378}, year = {2005}, url = {https://eprint.iacr.org/2005/378} }