Sciweavers

331 search results - page 65 / 67
» Provably Secure Timed-Release Public Key Encryption
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
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...
Nicolas Courtois
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
13 years 7 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti
CSFW
2002
IEEE
14 years 13 days ago
Types and Effects for Asymmetric Cryptographic Protocols
We present the first type and effect system for proving authenticity properties of security protocols based on asymmetric cryptography. The most significant new features of our ...
Andrew D. Gordon, Alan Jeffrey
PODC
2003
ACM
14 years 21 days ago
Scalable public-key tracing and revoking
Traitor Tracing Schemes constitute a very useful tool against piracy in the context of digital content broadcast. In such multi-recipient encryption schemes, each decryption key is...
Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti...
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 7 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai