7 search results - page 1 / 2 » Automated Proofs of Pairing-Based Cryptography |
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
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...
FMICS
2010
Springer
13 years 5 months ago
2010
Springer
Identity Mixer is an anonymous credential system developed at IBM that allows users for instance to prove that they are over 18 years old without revealing their name or birthdate....
INFORMATICALT
2006
13 years 4 months ago
2006
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...
HIP
2005
Springer
13 years 10 months ago
2005
Springer
Human interaction proofs (HIPs) have become common place on the internet due to their effectiveness in deterring automated abuse of online services intended for humans. However, th...
ISW
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...