Sciweavers

204 search results - page 10 / 41
» On Provably Secure Time-Stamping Schemes
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to work in a scenario in which the group membership is not known in advance but where parti...
Emmanuel Bresson, Olivier Chevassut, David Pointch...
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 5 days ago
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
Anand Desai
EUROCRYPT
2001
Springer
14 years 9 days ago
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
Masayuki Abe
PKC
2012
Springer
219views Cryptology» more  PKC 2012»
11 years 10 months ago
On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
We identify a potential weakness in the standard security model for dynamic group signatures which appears to have been overlooked previously. More specifically, we highlight tha...
Yusuke Sakai, Jacob C. N. Schuldt, Keita Emura, Go...
ICISC
2007
95views Cryptology» more  ICISC 2007»
13 years 9 months ago
Security-Preserving Asymmetric Protocol Encapsulation
Query-response based protocols between a client and a server such as SSL, TLS, SSH are asymmetric in the sense that the querying client and the responding server play different ro...
Raphael C.-W. Phan, Serge Vaudenay