Sciweavers

135 search results - page 8 / 27
» Formal Indistinguishability Extended to the Random Oracle Mo...
Sort
View
ISCI
2008
160views more  ISCI 2008»
13 years 7 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
ASIACRYPT
2004
Springer
13 years 11 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
ESORICS
2005
Springer
14 years 1 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
ISW
2010
Springer
13 years 5 months ago
Security Analysis of the Extended Access Control Protocol for Machine Readable Travel Documents
We analyze the Extended Access Control (EAC) protocol for authenticated key agreement, recently proposed by the German Federal Office for Information Security (BSI) for the deploym...
Özgür Dagdelen, Marc Fischlin
CCS
2007
ACM
14 years 1 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk