Sciweavers

6137 search results - page 934 / 1228
» Securing Collaborative Applications
Sort
View
EUROCRYPT
2000
Springer
15 years 10 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
FC
2000
Springer
150views Cryptology» more  FC 2000»
15 years 10 months ago
Self-Scrambling Anonymizers
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
David Pointcheval
FPGA
2000
ACM
175views FPGA» more  FPGA 2000»
15 years 10 months ago
An FPGA implementation and performance evaluation of the Serpent block cipher
With the expiration of the Data Encryption Standard (DES) in 1998, the Advanced Encryption Standard (AES) development process is well underway. It is hoped that the result of the ...
Adam J. Elbirt, Christof Paar
OOPSLA
2000
Springer
15 years 10 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
SPW
2000
Springer
15 years 10 months ago
Users and Trust in Cyberspace
The underlying belief and knowledge models assumed by various kinds of authentication protocols have been studied for well over 10 years now. On the other hand, the related questio...
Pekka Nikander, Kristiina Karvonen