Sciweavers

EUROCRYPT
2000
Springer
14 years 3 months ago
Efficient Proofs that a Committed Number Lies in an Interval
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a spe...
Fabrice Boudot
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Efficient Non-malleable Commitment Schemes
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
Marc Fischlin, Roger Fischlin
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Differential Fault Attacks on Elliptic Curve Cryptosystems
Ingrid Biehl, Bernd Meyer, Volker Müller
CHES
2000
Springer
97views Cryptology» more  CHES 2000»
14 years 3 months ago
Software-Hardware Trade-Offs: Application to A5/1 Cryptanalysis
This paper shows how a well-balanced trade-off between a generic workstation and dumb but fast reconfigurable hardware can lead to a more efficient implementation of a cryptanalysi...
Thomas Pornin, Jacques Stern
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
14 years 3 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay
CHES
2000
Springer
121views Cryptology» more  CHES 2000»
14 years 3 months ago
On Boolean and Arithmetic Masking against Differential Power Analysis
Abstract. Since the announcement of the Differential Power Analysis (DPA) by Paul Kocher and al., several countermeasures were proposed in order to protect software implementations...
Jean-Sébastien Coron, Louis Goubin
CHES
2000
Springer
135views Cryptology» more  CHES 2000»
14 years 3 months ago
Differential Power Analysis in the Presence of Hardware Countermeasures
Abstract. The silicon industry has lately been focusing on side channel attacks, that is attacks that exploit information that leaks from the physical devices. Although different c...
Christophe Clavier, Jean-Sébastien Coron, N...
ASIACRYPT
2000
Springer
14 years 3 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
ASIACRYPT
2000
Springer
14 years 3 months ago
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
In this paper we introduce a structure iterated by the rule A of Skipjack and show that this structure is provably resistant against differential or linear attacks. It is the main ...
Jaechul Sung, Sangjin Lee, Jong In Lim, Seokhie Ho...