1064 search results - page 113 / 213 » Cryptography from Anonymity |
138
click to vote
CRYPTO
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
189
click to vote
EUROCRYPT
1999
Springer
15 years 8 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...
122
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
209
click to vote
PKC
2011
Springer
14 years 6 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
130
click to vote
AVSS
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper presents a framework for preserving privacy in video surveillance. Raw video is decomposed into a background and one or more object-video streams. Objectvideo streams...