Sciweavers

2108 search results - page 206 / 422
» Encrypted
Sort
View
EUROCRYPT
2004
Springer
15 years 9 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
EUROPKI
2004
Springer
15 years 9 months ago
Using LDAP Directories for Management of PKI Processes
We present a framework for extending the functionality of LDAP servers from their typical use as a public directory in public key infrastructures. In this framework the LDAP server...
Vangelis Karatsiolis, Marcus Lippert, Alexander Wi...
127
Voted
FC
2004
Springer
112views Cryptology» more  FC 2004»
15 years 9 months ago
The Vector-Ballot e-Voting Approach
Looking at current cryptographic-based e-voting protocols, one can distinguish three basic design paradigms (or approaches): (a) Mix-Networks based, (b) Homomorphic Encryption base...
Aggelos Kiayias, Moti Yung
133
Voted
FOCS
2002
IEEE
15 years 9 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
135
Voted
EUROCRYPT
1997
Springer
15 years 8 months ago
A New Public-Key Cryptosystem
This paper describes a new public-key cryptosystem where the ciphertext is obtained by multiplying the public-keys indexed by the message bits and the cleartext is recovered by fac...
David Naccache, Jacques Stern