Sciweavers

SACRYPT
1999
Springer
14 years 3 months ago
Modeling Linear Characteristics of Substitution-Permutation Networks
Liam Keliher, Henk Meijer, Stafford E. Tavares
SACRYPT
1999
Springer
119views Cryptology» more  SACRYPT 1999»
14 years 3 months ago
A Universal Encryption Standard
Abstract. DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback: their block size is limited to 64 bits. While the cryptogra...
Helena Handschuh, Serge Vaudenay
PKC
1999
Springer
91views Cryptology» more  PKC 1999»
14 years 3 months ago
A Secure Pay-per View Scheme for Web-Based Video Service
With the development of high speed computer networks, video service on the Web has huge market potential in that the video service can be provided to subscribers with greater time ...
Jianying Zhou, Kwok-Yan Lam
PKC
1999
Springer
94views Cryptology» more  PKC 1999»
14 years 3 months ago
Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
Pascal Paillier
PKC
1999
Springer
86views Cryptology» more  PKC 1999»
14 years 3 months ago
Preserving Privacy in Distributed Delegation with Fast Certificates
Abstract. In a distributed system, dynamically dividing execution between nodes is essential for service robustness. However, when all of the nodes cannot be equally trusted, and w...
Pekka Nikander, Yki Kortesniemi, Jonna Partanen
PKC
1999
Springer
96views Cryptology» more  PKC 1999»
14 years 3 months ago
How to Copyright a Function?
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solu...
David Naccache, Adi Shamir, Julien P. Stern
PKC
1999
Springer
87views Cryptology» more  PKC 1999»
14 years 3 months ago
On the Security of RSA Screening
Since many applications require the verification of large sets of signatures, it is sometimes advantageous to perform a simultaneous verification instead of checking each signatu...
Jean-Sébastien Coron, David Naccache