Results 191 to 200 of about 618 (230)

Accumulators from Bilinear Pairings and Applications

2005
We propose a dynamic accumulator scheme from bilinear pairings and use it to construct an identity-based (ID-based) ring signature scheme with constant-size signatures and to provide membership revocation to group signature schemes, identity escrow schemes and anonymous credential systems.
openaire   +1 more source

Short Traceable Signatures Based on Bilinear Pairings

2006
We propose a short traceable signature scheme based on bilinear pairings. Traceable signatures, introduced by Kiayias, Tsiounis and Yung (KTY), support an extended set of fairness mechanisms (mechanisms for anonymity management and revocation) when compared with the traditional group signatures.
Seung Geol Choi, Kunsoo Park, Moti Yung
openaire   +1 more source

A Bilinear Pairing Based Hidden-Signature Scheme

2010
In this paper we propose a bilinear pairing based hidden blind signature scheme. The proposed scheme allows the signer to append information to the hidden signed message. The requester cannot modify neither this information nor the signed message.
Mohamed Rasslan, Amr M. Youssef
openaire   +1 more source

Bilinear Pairing Based DAA Protocol

2009 International Conference on Computational Intelligence and Natural Computing, 2009
Direct Anonymous Attestation (DAA) is adopted by the Trusted Platform Module (TPM) of v1.2 standard described by the Trusted Computing Group (TCG), aimed at settling protocols for trusted platform attestation and platform privacy protection. This paper gives a presentation of the new DAA protocol based on bilinear pairings and an analysis of its ...
Hong-hu Zhen, Yue Chen
openaire   +1 more source

A Ring Signature Scheme Using Bilinear Pairings

2005
The bilinear pairings such as Weil pairing or Tate pairing over elliptic curves and hyperelliptic curves have been found various applications in cryptography very recently. Ring signature is a very useful tool to provide the user's anonymity and the signer's privacy.
Jing Xu 0002, Zhenfeng Zhang, Dengguo Feng   +2 more
openaire   +1 more source

Signature scheme based on bilinear pairs

SPIE Proceedings, 2013
An identity-based signature scheme is proposed by using bilinear pairs technology. The scheme uses user’s identity information as public key such as email address, IP address, telephone number so that it erases the cost of forming and managing public key infrastructure and avoids the problem of user private generating center generating forgery ...
Rui Y. Tong, Yong J. Geng
openaire   +1 more source

Two Threshold Multisignature Schemes from Bilinear Pairings

2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07), 2007
Threshold multisignature combines the traits of threshold signature and multisignature. It solves the problem that any t users can impersonate other t users' signatures in threshold signature. Identity-based public key systems allow the user to use his identity as the public key, which can simplify the key management procedure compared with CA-based ...
Guowen Li, Jia Yu 0003, Rupeng Li, Daxing Li   +3 more
openaire   +1 more source

Robust Certificateless Signature Scheme without Bilinear Pairings

2013 International Conference on IT Convergence and Security (ICITCS), 2013
During these years, the research field of certificateless signature (CLS) scheme without bilinear pairings is promptly investigated as the key escrow problem in identity-based cryptography can be solved via this concept. In this paper, we demonstrate that a certificateless signature scheme proposed by Gong and Li cannot fulfil its security claims.
Kuo-Hui Yeh, Kuo-Yu Tsai, Ren-Zong Kuo, Tzong-Chen Wu   +3 more
openaire   +1 more source

Policy-based encryption schemes from bilinear pairings

Proceedings of the 2006 ACM Symposium on Information, computer and communications security, 2006
The concept of policy-based cryptography is a promising paradigm for trust establishment and authorization in largescale open environments like the Internet and Mobile Networks. It aims at providing a framework for performing cryptographic operations with respect to policies formalized as monotone Boolean expressions written in standard normal forms. A
Walid Bagga, Refik Molva, Stefano Crosta
openaire   +1 more source

Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings

2012 IEEE 25th Computer Security Foundations Symposium, 2012
Bilinear pairings are powerful mathematical structures that can be used in cryptography. Their equational properties allow constructing cryptographic primitives and protocols that would be otherwise ineffective or even impossible. In formal cryptography, the protocols are expressed through term algebras and process calculi.
Alisa Pankova, Peeter Laud
openaire   +1 more source