18 search results - page 3 / 4 » An Oblivious Transfer Protocol with Log-Squared Communicatio... |
104
click to vote
SCN
2008
Springer
14 years 11 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
107
click to vote
CCS
2011
ACM
13 years 11 months ago
2011
ACM
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
CRYPTO
2007
Springer
15 years 5 months ago
2007
Springer
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
104
click to vote
JOC
2008
14 years 11 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
108
click to vote
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....