Sciweavers

29 search results - page 4 / 6
» New Signature Schemes with Coupons and Tight Reduction
Sort
View
DATE
1999
IEEE
80views Hardware» more  DATE 1999»
13 years 12 months ago
Symmetric Transparent BIST for RAMs
The paper introduces the new concept of symmetric transparent BIST for RAMs. This concept allows to skip the signature prediction phase of conventional transparent BIST approaches...
Sybille Hellebrand, Hans-Joachim Wunderlich, Vyach...
ICALP
2005
Springer
14 years 1 months ago
Append-Only Signatures
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Bara...
ASIACRYPT
2010
Springer
13 years 5 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
CHES
2003
Springer
149views Cryptology» more  CHES 2003»
14 years 25 days ago
Attacking Unbalanced RSA-CRT Using SPA
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
Pierre-Alain Fouque, Gwenaëlle Martinet, Guil...
PODC
1998
ACM
13 years 11 months ago
Optimal Efficiency of Optimistic Contract Signing
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
Birgit Pfitzmann, Matthias Schunter, Michael Waidn...