49 search results - page 1 / 10 » Cryptography with Constant Input Locality |
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
CHARME
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...