Sciweavers

120
Voted
CSFW
2000
IEEE
15 years 7 months ago
Confidentiality for Mobile Code: The Case of a Simple Payment Protocol
We propose an approach to support confidentiality for mobile implementations of security-sensitive protocols using Java/JVM. An applet which receives and passes on confidential in...
Mads Dam, Pablo Giambiagi
114
Voted
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
15 years 7 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
257
Voted
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
15 years 7 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
113
Voted
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 7 months ago
Differential Fault Attacks on Elliptic Curve Cryptosystems
Ingrid Biehl, Bernd Meyer, Volker Müller
111
Voted
CPM
2000
Springer
111views Combinatorics» more  CPM 2000»
15 years 7 months ago
Parametric Multiple Sequence Alignment and Phylogeny Construction
David Fernández-Baca, Timo Seppälä...