Sciweavers

211 search results - page 19 / 43
» PSS Is Secure against Random Fault Attacks
Sort
View
ASIACRYPT
2000
Springer
15 years 9 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
ICISC
2004
112views Cryptology» more  ICISC 2004»
15 years 7 months ago
Improvement on Ha-Moon Randomized Exponentiation Algorithm
Randomized recoding on the exponent of an exponentiation computation into a signed-digit representation has been a well known countermeasure against some side-channel attacks. Howe...
Sung-Ming Yen, Chien-Ning Chen, Sang-Jae Moon, Jae...
SP
2003
IEEE
15 years 11 months ago
Random Key Predistribution Schemes for Sensor Networks
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because th...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song
COMCOM
2008
82views more  COMCOM 2008»
15 years 6 months ago
Virtual password using random linear functions for on-line services, ATM machines, and pervasive computing
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...
Ming Lei, Yang Xiao, Susan V. Vrbsky, Chung-Chih L...