659 search results - page 63 / 132 » Compiling and securing cryptographic protocols |
93
Voted
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
98
Voted
EUROCRYPT
2006
Springer
15 years 4 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
110
click to vote
SIAMCOMP
2008
14 years 11 months ago
2008
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
93
Voted
DAGSTUHL
2007
15 years 1 months ago
2007
Civitas is the first implementation of a coercion-resistant, universally verifiable, remote voting scheme. This paper describes the design of Civitas, details the cryptographic ...
ISCC
2009
IEEE
15 years 7 months ago
2009
IEEE
The Hill cipher is a classical symmetric encryption algorithm that succumbs to the know-plaintext attack. Although its vulnerability to cryptanalysis has rendered it unusable in p...