612 search results - page 104 / 123 » Hardness assumptions in the foundations of theoretical compu... |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and locked boxes, often used as illustrations for common cryptographic ope...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
CCR
2002
13 years 7 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...