Sciweavers

18 search results - page 3 / 4
» An Oblivious Transfer Protocol with Log-Squared Communicatio...
Sort
View
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 6 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
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...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
CCS
2011
ACM
12 years 6 months ago
Practical PIR for electronic commerce
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 ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
14 years 13 days ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
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...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
JOC
2008
86views more  JOC 2008»
13 years 6 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
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...
Yehuda Lindell
EUROCRYPT
2000
Springer
13 years 9 months ago
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
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....
Eyal Kushilevitz, Rafail Ostrovsky