Sciweavers

27 search results - page 2 / 6
» pkc 2007
Sort
View
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
13 years 11 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
13 years 11 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
PKC
2007
Springer
132views Cryptology» more  PKC 2007»
13 years 11 months ago
Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
Abstract. We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. Our approach uses functions that estimate the distance of a group...
Dima Ruinskiy, Adi Shamir, Boaz Tsaban
PKC
2007
Springer
135views Cryptology» more  PKC 2007»
13 years 11 months ago
A Direct Anonymous Attestation Scheme for Embedded Devices
Abstract. Direct anonymous attestation (DAA) is an anonymous authentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. Th...
He Ge, Stephen R. Tate
PKC
2007
Springer
147views Cryptology» more  PKC 2007»
13 years 11 months ago
New Chosen-Ciphertext Attacks on NTRU
We present new and efficient key-recovery chosen-ciphertext attacks on NTRUencrypt. Our attacks are somewhat intermediate between chosen-ciphertext attacks on NTRUencrypt previousl...
Nicolas Gama, Phong Q. Nguyen