Now showing items 1-6 of 6

• #### Cryptographic Combinatorial Clock-Proxy Auctions ﻿

(Springer Verlag, 2009)
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The "clock phase" functions as a trusted auction despite price discovery: bidders ...
• #### Practical secrecy-preserving, verifiably correct and trustworthy auctions ﻿

(Elsevier, 2008)
We present a practical protocol based on homomorphic cryptography for conducting provably fair sealed-bid auctions. The system preserves the secrecy of the bids, even after the announcement of auction results, while also ...
• #### Practical secrecy-preserving, verifiably correct and trustworthy auctions. ﻿

(Association for Computing Machinery, 2006)
We present a practical system for conducting sealed-bid auctions that preserves the secrecy of the bids while providing for verifiable correctness and trustworthiness of the auction. The auctioneer must accept all bids ...
• #### Selecting Closest Vectors Through Randomization ﻿

(2000)
We consider the problem of finding the closest vectors to a given vector in a large set of vectors, and propose a randomized solution. The method has applications in Automatic Target Recognition (ATR), Web Information ...
• #### Time-Lapse Cryptography ﻿

(2006)
The notion of “sending a secret message to the future” has been around for over a decade. Despite this, no solution to this problem is in common use, or even attained widespread acceptance as a fundamental cryptographic ...
• #### Verifiable Random Functions ﻿

(IEEE Computer Society Press, 1999)
We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali notion of pseudorandom functions $f_s$ from a secret seed s, so that knowledge of $s$ not only enables one to ...