Sciweavers

59 search results - page 6 / 12
» Fair Encryption of RSA Keys
Sort
View
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
15 years 10 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
ACNS
2005
Springer
113views Cryptology» more  ACNS 2005»
15 years 11 months ago
A Traitor Tracing Scheme Based on RSA for Fast Decryption
Abstract. We describe a fully k-resilient traitor tracing scheme that utilizes RSA as a secret-key rather than public-key cryptosystem. Traitor tracing schemes deter piracy in broa...
John Patrick McGregor, Yiqun Lisa Yin, Ruby B. Lee
CHES
1999
Springer
99views Cryptology» more  CHES 1999»
15 years 9 months ago
Probing Attacks on Tamper-Resistant Devices
Abstract. This paper describes a new type of attack on tamper-resistant cryptographic hardware. We show that by locally observing the value of a few RAM or adress bus bits (possibl...
Helena Handschuh, Pascal Paillier, Jacques Stern
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
15 years 10 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
INDOCRYPT
2004
Springer
15 years 10 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...