Sciweavers

241 search results - page 5 / 49
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
ICICS
2007
Springer
14 years 10 days ago
A Framework for Game-Based Security Proofs
Abstract. To be accepted, a cryptographic scheme must come with a proof that it satisfies some standard security properties. However, because cryptographic schemes are based on no...
David Nowak
SISW
2005
IEEE
13 years 11 months ago
Lazy Revocation in Cryptographic File Systems
A crucial element of distributed cryptographic file systems are key management solutions that allow for flexible but secure data sharing. We consider efficient key management s...
Michael Backes, Christian Cachin, Alina Oprea
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
13 years 10 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
ASIACRYPT
2007
Springer
14 years 11 days ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth