Sciweavers

22 search results - page 4 / 5
» Generalized Oblivious Transfer Protocols Based on Noisy Chan...
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 8 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
EUROCRYPT
2000
Springer
13 years 11 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
ADHOCNOW
2005
Springer
14 years 1 months ago
Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...
Carlos H. Rentel, Thomas Kunz
NDSS
2008
IEEE
14 years 1 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion
CCS
2011
ACM
12 years 7 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