Sciweavers

2967 search results - page 154 / 594
» Cryptology
Sort
View
185
Voted
EUROCRYPT
2007
Springer
15 years 11 months ago
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
Ueli M. Maurer, Johan Sjödin
203
Voted
ASIACRYPT
2006
Springer
15 years 10 months ago
Analysis of One Popular Group Signature Scheme
The group signature scheme [1], ACJT for short, is popular. In this paper we show that it is not secure. It does not satisfy exculpability. The group manager can sign on behalf of ...
Zhengjun Cao
CTRSA
2004
Springer
114views Cryptology» more  CTRSA 2004»
15 years 10 months ago
Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt '95
We present a cryptanalysis of a zero-knowledge identification protocol introduced by Naccache et al. at Eurocrypt '95. Our cryptanalysis enables a polynomial-time attacker to ...
Jean-Sébastien Coron, David Naccache
159
Voted
CANS
2006
Springer
90views Cryptology» more  CANS 2006»
15 years 10 months ago
Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous on...
Sujing Zhou, Dongdai Lin
CRYPTO
2006
Springer
109views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...
Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan