Sciweavers

Share
EUROCRYPT
2012
Springer
7 years 19 days ago
Lattice Signatures without Trapdoors
We provide an alternative method for constructing lattice-based digital signatures which does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan (ST...
Vadim Lyubashevsky
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
7 years 19 days ago
Security of Blind Signatures Revisited
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established de...
Dominique Schröder, Dominique Unruh
INFOCOM
2012
IEEE
7 years 20 days ago
Enhanced wireless channel authentication using time-synched link signature
Abstract— Wireless link signature is a physical layer authentication mechanism, which uses the unique wireless channel characteristics between a transmitter and a receiver to pro...
Yao Liu, Peng Ning
IACR
2011
104views more  IACR 2011»
7 years 10 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
IACR
2011
90views more  IACR 2011»
7 years 10 months ago
On the Security of the Winternitz One-Time Signature Scheme
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...
IACR
2011
80views more  IACR 2011»
7 years 10 months ago
History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
Marc Fischlin, Anja Lehmann, Dominique Schröd...
IACR
2011
94views more  IACR 2011»
7 years 10 months ago
Practical Key-recovery For All Possible Parameters of SFLASH
In this paper we present a new practical key-recovery attack on the SFLASH signature scheme. SFLASH is a derivative of the older C∗ encryption and signature scheme that was broke...
Charles Bouillaguet, Pierre-Alain Fouque, Gilles M...
IACR
2011
142views more  IACR 2011»
7 years 10 months ago
XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...
Johannes Buchmann, Erik Dahmen, Andreas Hülsi...
IACR
2011
112views more  IACR 2011»
7 years 10 months ago
A Domain Transformation for Structure-Preserving Signatures on Group Elements
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
Melissa Chase, Markulf Kohlweiss
ASIACRYPT
2011
Springer
7 years 10 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
books