Sciweavers

23 search results - page 3 / 5
» Provable Partial Key Escrow
Sort
View
TCS
2008
13 years 7 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
CRYPTO
2008
Springer
100views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Abstract. This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verif...
Helena Handschuh, Bart Preneel
CIS
2005
Springer
14 years 1 months ago
ID-Based Restrictive Partially Blind Signatures
Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain...
Xiaofeng Chen, Fangguo Zhang, Shengli Liu
DCC
2003
IEEE
14 years 7 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
JOC
2002
99views more  JOC 2002»
13 years 7 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski