搜索结果: 16-30 共查到“军事学 bilinear pairings”相关记录34条 . 查询时间(0.109 秒)
ID-Based Chameleon Hashes from Bilinear Pairings
Chameleon hash Chameleon signature ID-based cryptosystem Bilinear pairings
2009/4/10
Chameleon hash function is a trapdoor one-way hash func-
tion. The ID-based chameleon hash function was first introduced by Ate-
niese and Medeiros [1]. As discussed by [1], the general advantages o...
An identity-based ring signature scheme from bilinear pairings
ring signature identity-based bilinear pairings
2009/4/9
At the conference Asiacrypt 2001, Rivest, Shamir and Tauman firstly addressed the
concept of ring signature. In this paper we propose an identity-based ring signature
scheme from bilinear pairings. ...
A New ID-based Group Signature Scheme from Bilinear Pairings
Group signature Bilinear pairings ID-based cryptography
2009/4/9
We argue that traditional ID-based systems from pairings
seem unsuitable for designing group signature schemes due to the problem
of key escrow. In this paper we propose new ID-based public key
sys...
New Proxy Signature, Proxy Blind Signature and Proxy Ring Signature Schemes from Bilinear Pairings
Proxy signature ID-based cryptography Proxy blind signature Proxy ring signature
2009/4/9
Proxy signatures are very useful tools when one needs to
delegate his/her signing capability to other party. After Mambo et al:’s
first scheme was announced, many proxy signature schemes and various...
ID-Based Proxy Signature Using Bilinear Pairings
ID-based signatures proxy signatures bilinear pairings
2009/3/27
Identity-based (ID-based) public key cryptosystem can be a
good alternative for certificate-based public key setting, especially when
efficient key management and moderate security are required. A p...
ID-based Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings
Cryptography Digital Signature Ring Signature
2009/3/27
In 2001, Rivest et al. firstly introduced the concept of ring
signatures. A ring signature is a simplified group signature without any
manager. It protects the anonymity of a signer. The first schem...
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
threshold partially blind signature identity-based partially blind signature bilinear pairings
2009/3/26
A blind signature scheme is a protocol for obtaining a digital signature from a signer,but the signer can neither learn the messages he/she sign nor the signatures the recipients obtain afterwards. Pa...
Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings
Group signatures traceable signatures membership revocation
2009/3/26
Group signature schemes are cryptographic systems that
provide revocable anonymity for signers. We propose a group signature
scheme with constant-size public key and signature length that does not
...
Zero-Knowledge Blind Identification For Smart Cards Using Bilinear Pairings
Zero-Knowledge Blind Identification Smart Cards Bilinear Pairings
2009/3/9
In identification protocols with public verifier coins (like Fiat-Shamir), a passive adversary watch-
ing the communication gains information intended only for the verifier. On the other hand, privat...
An Authentication Protocol For Mobile Agents Using Bilinear Pairings
Authentication Protocol Mobile Agents Bilinear Pairings
2009/2/25
A mobile agent is a mobile program capable of maintaining its execution states as it migrates
between different execution platforms. A key security problem in the mobile agent paradigm is
that of tr...
Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and
Dynamic accumulators ID-based ring signatures ad-hoc anonymous identification
2009/2/5
We propose a dynamic accumulator scheme from bilinear
pairings, whose security is based on the Strong Diffie-Hellman assumption.
We show applications of this accumulator in constructing an identityb...
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms
Tate pairing non-supersingular curves pairing-based cryptosystems automorphisms
2009/1/8
In this paper we present a new algorithm for computing the
bilinear pairings on a family of non-supersingular elliptic curves with
non-trivial automorphisms. We obtain a short iteration loop in Mill...
A New Type of Group Blind Signature Scheme Based on Bilinear Pairings
Group Signature Group Blind Signature Information Security
2009/1/5
This paper constructs a new group blind signature scheme on the basis of CZK group signature scheme. The security of the new scheme is under the computational Diffie-Hellman problem in the random orac...
A Novel Secure Electronic Voting Protocol Based On Bilinear Pairings
electronic voting bilinear pairings ID-based cryptographic system
2008/12/22
In 1997, Cranor and Cytron proposed an electronic voting protocol, Sensus
protocol, intended to be applied in a real election. However, in 2005 Fabrizio et.al.
pointed out there is a vulnerability e...
Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings
signcryption multi-recipient signcryption bilinear pairings provable security
2008/12/22
Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at a lower computational costs and communication overheads than the signature-then-encryption approach....