679 search results - page 24 / 136 » Using decision problems in public key cryptography |
145
click to vote
EUROCRYPT
2012
Springer
13 years 3 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
130
click to vote
PERCOM
2011
ACM
14 years 5 months ago
2011
ACM
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
ACISP
2005
Springer
15 years 6 months ago
2005
Springer
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
ACSAC
2000
IEEE
15 years 5 months ago
2000
IEEE
The widespread use of public networks, such as the Internet, for the exchange of sensitive data, like legally valid documents and business transactions, poses severe security cons...
127
click to vote
ASIACRYPT
2001
Springer
15 years 4 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...