Sciweavers

85 search results - page 4 / 17
» Short Signatures Without Random Oracles
Sort
View
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
14 years 2 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
14 years 5 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
IJSN
2006
96views more  IJSN 2006»
13 years 11 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan
ICALP
2007
Springer
14 years 5 months ago
Ring Signatures of Sub-linear Size Without Random Oracles
Ring signatures, introduced by Rivest, Shamir and Tauman, enable a user to sign a message anonymously on behalf of a “ring”. A ring is a group of users, which includes the sign...
Nishanth Chandran, Jens Groth, Amit Sahai
EUROCRYPT
2012
Springer
12 years 1 months 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