Sciweavers

32 search results - page 5 / 7
» Secure Delegation of Elliptic-Curve Pairing
Sort
View
EUROCRYPT
2010
Springer
13 years 12 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
14 years 14 days ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 9 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...
IJNSEC
2007
164views more  IJNSEC 2007»
13 years 7 months ago
A Biometric Identity Based Signature Scheme
We describe an identity based signature scheme that uses biometric information to construct the public key. Such a scheme would be beneficial in many repudiation situations for e...
Andrew Burnett, Fergus Byrne, Tom Dowling, Adam Du...
ATC
2007
Springer
14 years 1 months ago
Identity-Based Proxy Signature from Pairings
A proxy signature scheme allows an entity to delegate its signing capability to another entity (proxy) in such a way that the proxy can sign messages on behalf of the delegator. Pr...
Wei Wu, Yi Mu, Willy Susilo, Jennifer Seberry, Xin...