400 search results - page 54 / 80 » Cryptography and computer security for undergraduates |
JOC
2002
14 years 9 months ago
2002
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
PKC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
131
click to vote
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
DSN
2007
IEEE
15 years 4 months ago
2007
IEEE
Cryptography has become an indispensable mechanism for securing systems, communications and applications. While offering strong protection, cryptography makes the assumption that ...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...