Sciweavers

SCN
2008
Springer
13 years 9 months ago
Linear Bandwidth Naccache-Stern Encryption
Abstract. The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying publ...
Benoît Chevallier-Mames, David Naccache, Jac...
SCN
2008
Springer
13 years 9 months ago
Using Normal Bases for Compact Hardware Implementations of the AES S-Box
Abstract. The substitution box (S-box) of the Advanced Encryption Standard (AES) is based on the multiplicative inversion s(x) = x-1 in GF(256) and followed by an affine transforma...
Svetla Nikova, Vincent Rijmen, Martin Schläff...
SCN
2008
Springer
103views Communications» more  SCN 2008»
13 years 9 months ago
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
Christophe Petit, Kristin Lauter, Jean-Jacques Qui...
SCN
2008
Springer
13 years 9 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
SCN
2008
Springer
116views Communications» more  SCN 2008»
13 years 9 months ago
General Certificateless Encryption and Timed-Release Encryption
While recent timed-release encryption (TRE) schemes are implicitly supported by a certificateless encryption (CLE) mechanism, the security models of CLE and TRE differ and there is...
Sherman S. M. Chow, Volker Roth, Eleanor G. Rieffe...
SCN
2008
Springer
126views Communications» more  SCN 2008»
13 years 9 months ago
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
We consider the task of computing power productsQ 1ik gei i ("multi-exponentiation") where base elements g2, . . ., gk are fixed while g1 is variable between multi-expone...
Bodo Möller, Andy Rupp
SCN
2008
Springer
141views Communications» more  SCN 2008»
13 years 9 months ago
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
In 2004, Molnar and Wagner introduced a very appealing scheme dedicated to the identification of RFID tags. Their protocol relies on a binary tree of secrets which are shared
Julien Bringer, Hervé Chabanne, Thomas Icar...
SCN
2008
Springer
146views Communications» more  SCN 2008»
13 years 9 months ago
Anonymous Proxy Signatures
Georg Fuchsbauer, David Pointcheval
SCN
2008
Springer
13 years 9 months ago
An Identity-Based Key Agreement Protocol for the Network Layer
A new identity-based key agreement protocol designed to operate on thenetworklayerispresented. Endpoint addresses, namelyIP and MAC addresses, areusedaspublickeystoauthenticatethe ...
Christian Schridde, Matthew Smith, Bernd Freislebe...