Results 1  10
of
1,640
Short signatures from the Weil pairing
, 2001
"... We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures ar ..."
Abstract

Cited by 755 (25 self)
 Add to MetaCart
We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures
A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks
, 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract

Cited by 959 (40 self)
 Add to MetaCart
were considered in the folklore to be contradictory. More generally, we show how to construct a signature scheme with such properties based on the existence of a "clawfree" pair of permutations  a potentially weaker assumption than the intractibility of integer factorization. The new scheme
Possible sneutrinopair signatures with Rparity breaking
, 1995
"... If sneutrinos are the lightest supersymmetry partners and Rparity is not conserved, the process e + e − → ˜¯ν˜ν can have striking signatures due to the decay modes ˜ν → ℓ + ℓ ′ − or ˜ν → q¯q ′. We present cross section formulas and discuss event rates and detection at the upgraded e + e − collider ..."
Abstract
 Add to MetaCart
If sneutrinos are the lightest supersymmetry partners and Rparity is not conserved, the process e + e − → ˜¯ν˜ν can have striking signatures due to the decay modes ˜ν → ℓ + ℓ ′ − or ˜ν → q¯q ′. We present cross section formulas and discuss event rates and detection at the upgraded e + e
Efficient Identity Based Signature Schemes Based on Pairings
 SAC 2002, LNCS 2595
, 2002
"... We develop an efficient identity based signature scheme based on pairings whose security relies on the hardness of the DiffieHellman problem in the random oracle model. We describe how this scheme is obtained as a special version of a more general generic scheme which yields further new provably se ..."
Abstract

Cited by 198 (2 self)
 Add to MetaCart
We develop an efficient identity based signature scheme based on pairings whose security relies on the hardness of the DiffieHellman problem in the random oracle model. We describe how this scheme is obtained as a special version of a more general generic scheme which yields further new provably
IDBased Blind Signature and Ring Signature from Pairings
 Proc. of Asiacrpt2002, LNCS 2501
, 2002
"... Recently the bilinear pairing such as Weil pairing or Tate pairing on elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identitybased (simply IDbased) cryptosystems using bilinear pairings of elliptic curves or hyperelliptic curves were presente ..."
Abstract

Cited by 99 (13 self)
 Add to MetaCart
Recently the bilinear pairing such as Weil pairing or Tate pairing on elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identitybased (simply IDbased) cryptosystems using bilinear pairings of elliptic curves or hyperelliptic curves were
Signature
, 2008
"... The key substitution property is introduced by BlakeWilson and Menezes [1] and formalized by Menezes and Smart [8] as attacks. The key substitution property is as follow: another person other than true signer can produce another public (and secret) key such that a message and signature pair created ..."
Abstract
 Add to MetaCart
The key substitution property is introduced by BlakeWilson and Menezes [1] and formalized by Menezes and Smart [8] as attacks. The key substitution property is as follow: another person other than true signer can produce another public (and secret) key such that a message and signature pair
Signature
, 2002
"... The Laser Electron Acceleration Project (LEAP) group has been conducting a proof of principle experiment on the acceleration of electrons with a pair of crossed laser beams. To date there has been no experimental verification of electron acceleration with crossed laser beams in a dielectric loaded v ..."
Abstract
 Add to MetaCart
The Laser Electron Acceleration Project (LEAP) group has been conducting a proof of principle experiment on the acceleration of electrons with a pair of crossed laser beams. To date there has been no experimental verification of electron acceleration with crossed laser beams in a dielectric loaded
SIGNATURE PAIRS OF POSITIVE POLYNOMIALS
"... Abstract. A wellknown theorem of Quillen says that if r(z, z̄) is a bihomogeneous polynomial on Cn positive on the sphere, then there exists d such that r(z, z̄)‖z‖2d is a squared norm. We obtain effective bounds relating this d to the signature of r. We obtain the sharp bound for d = 1, and for d ..."
Abstract
 Add to MetaCart
Abstract. A wellknown theorem of Quillen says that if r(z, z̄) is a bihomogeneous polynomial on Cn positive on the sphere, then there exists d such that r(z, z̄)‖z‖2d is a squared norm. We obtain effective bounds relating this d to the signature of r. We obtain the sharp bound for d = 1
Certificateless Public Key Cryptography
 ASIACRYPT'03
, 2003
"... This paper introduces the concept of certificateless public key cryptography (CLPKC). In contrast to traditional public key cryptographic systems, CLPKC does not require the use of certificates to guarantee the authenticity of public keys. It does rely on the use of a trusted third party (TTP) who ..."
Abstract

Cited by 240 (4 self)
 Add to MetaCart
cryptography that is intermediate between traditional certificated PKC and IDPKC. We make concrete the concept of CLPKC by introducing certificateless public key encryption (CLPKE), signature and key exchange schemes. We also demonstrate how hierarchical CLPKC can be supported. The schemes are all derived
Results 1  10
of
1,640