Sciweavers

948 search results - page 25 / 190
» Attacking cryptographic schemes based on
Sort
View
WEA
2005
Springer
109views Algorithms» more  WEA 2005»
14 years 1 months ago
Synchronization Fault Cryptanalysis for Breaking A5/1
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich...
JSAC
2006
183views more  JSAC 2006»
13 years 7 months ago
HiRLoc: high-resolution robust localization for wireless sensor networks
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
Loukas Lazos, Radha Poovendran
IMTCI
2004
Springer
14 years 1 months ago
Mobile Agents: Preserving Privacy and Anonymity
The paper presents two new methods for providing mobile agents with privacy and anynomity. The proposed schemes are based on different cryptographic primitives: a secret-sharing s...
Aneta Zwierko, Zbigniew Kotulski
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
14 years 1 months ago
Masking at Gate Level in the Presence of Glitches
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
Wieland Fischer, Berndt M. Gammel
ICICS
2007
Springer
14 years 2 months ago
A Framework for Game-Based Security Proofs
Abstract. To be accepted, a cryptographic scheme must come with a proof that it satisfies some standard security properties. However, because cryptographic schemes are based on no...
David Nowak