zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Simulatability and security of certificateless threshold signatures. (English) Zbl 1125.94039
Summary: We analyze the relationship between the notion of certificateless public key cryptography (CL-PKC) and identity-based schemes without a trusted private key generator (PKG), formally define the security of certificateless threshold signatures, and propose a concrete implementation based on bilinear pairings. To exhibit the security of our proposal, we develop the theory of simulatability and relationship between the certificateless threshold signatures and the underlying (non-threshold) ID-based signatures. We show that the proposed scheme is robust and existentially unforgeable against adaptively chosen message attacks under CDH assumption in the random oracle model.

MSC:
94A62Authentication and secret sharing
WorldCat.org
Full Text: DOI
References:
[1] Al-Riyami, S. S.; Paterson, K. G.: Certificateless public key cryptography. Lncs 2894, 452-473 (2003) · Zbl 1205.94072
[2] Backes, M.; Pfitzmann, B.; Steiner, M.; Waidner, M.: Polynomial fairness and liveness. Proc. 15th IEEE computer security foundations workshop (CSFW’02), 1063-1078 (2002)
[3] Baek, J.; Safavi-Naini, R.; Susilo, W.: Certificateless public key encryption without pairing. Lncs 3650, 134-148 (2005) · Zbl 1127.94358
[4] Baek, J.; Zheng, Y.: Identity-based threshold signature scheme from the bilinear pairings. Proc. 2004 international conference on information technology: coding and computing (ITCC 2004), 124-128 (2004)
[5] Boneh, D.; Franklin, M.: Identity-based encryption from the Weil pairing. Lncs 2139, 213-229 (2001) · Zbl 1002.94023
[6] Chen, X.; Zhang, F.; Konidala, D. M.; Kim, K.: New ID-based threshold signature scheme from bilinear pairing. Lncs 3348, 371-383 (2004) · Zbl 1113.94308
[7] S. Duan, Z. Cao, R. Lu, Robust ID-based threshold signcryption scheme from pairings, in: Proc. 2004 International Conference on Information Security, Shanghai, China, ACM ISBN:1-58113-955-1, 2004, pp. 33 -- 37. · Zbl 1091.94505
[8] R. Dutta, R. Barua, P. Sarkar, Pairing-based cryptographic protocols: a survey, Cryptology ePrint Archive: Report 2004/064.
[9] Girault, M.: Self-certified public keys. Lncs 547, 490-497 (1991) · Zbl 0825.68374
[10] A. Joux, K. Nguyen, Separating decision Diffie -- Hellman from Diffie -- Hellman in cryptographic groups, Cryptology ePrint Archive: Report 2001/03. · Zbl 1101.14309
[11] Shamir, A.: Identity-based cryptosystems and signature schemes. Lncs 196, 47-53 (1985)
[12] Yao, A. C.: Protocols for secure computations. Proc. 23rd symposium on foundations of computer science (FOCS), 160-164 (1982)
[13] Yum, D. H.; Lee, P. J.: Generic construction of certificateless signature. Lncs 3108, 200-211 (2004) · Zbl 1098.94635
[14] Yum, D. H.; Lee, P. J.: Generic construction of certificateless encryption. Lncs 3043, 802-811 (2004) · Zbl 1108.68472