Sciweavers

2237 search results - page 238 / 448
» On the Security of Random Sources
Sort
View
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
15 years 11 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu
FSE
2006
Springer
107views Cryptology» more  FSE 2006»
15 years 10 months ago
Some Plausible Constructions of Double-Block-Length Hash Functions
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
Shoichi Hirose
CRYPTO
2010
Springer
197views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct...
Shweta Agrawal, Dan Boneh, Xavier Boyen
CORR
2006
Springer
111views Education» more  CORR 2006»
15 years 7 months ago
Length-based cryptanalysis: The case of Thompson's Group
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
Dima Ruinskiy, Adi Shamir, Boaz Tsaban
IJNSEC
2008
112views more  IJNSEC 2008»
15 years 7 months ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo