Sciweavers

90 search results - page 8 / 18
» Pairings for cryptographers
Sort
View
EUROCRYPT
2010
Springer
15 years 2 months ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
IJNSEC
2007
130views more  IJNSEC 2007»
14 years 9 months ago
An Attack on Libert et al.' s ID-based Undeniable Signature Scheme
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
Zichen Li, C. F. Chong, Lucas Chi Kwong Hui, Siu-M...
ACNS
2007
Springer
112views Cryptology» more  ACNS 2007»
15 years 3 months ago
Merkle Signatures with Virtually Unlimited Signature Capacity
We propose GMSS, a new variant of the Merkle signature scheme. GMSS is the first Merkle-type signature scheme that allows a cryptographically unlimited (280 ) number of documents ...
Johannes Buchmann, Erik Dahmen, Elena Klintsevich,...
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
14 years 11 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
95
Voted
JSS
2011
106views more  JSS 2011»
14 years 12 days ago
A family of implementation-friendly BN elliptic curves
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...