-
1
-
-
33646840349
-
On the minimal assumptions of group signature schemes
-
López, J., Qing, S., Okamoto, E. (eds.) Springer, Heidelberg
-
Abdalla, M., Warinschi, B.: On the minimal assumptions of group signature schemes. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 1-13. Springer, Heidelberg (2004)
-
(2004)
ICICS 2004. LNCS
, vol.3269
, pp. 1-13
-
-
Abdalla, M.1
Warinschi, B.2
-
2
-
-
84921018856
-
A practical and provably secure coalition-resistant group signature scheme
-
Bellare, M. (ed.) Springer, Heidelberg
-
Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255-270. Springer, Heidelberg (2000)
-
(2000)
CRYPTO 2000. LNCS
, vol.1880
, pp. 255-270
-
-
Ateniese, G.1
Camenisch, J.2
Joye, M.3
Tsudik, G.4
-
3
-
-
84957043547
-
Quasi-efficient revocation in group signatures
-
Blaze, M. (ed.) Springer, Heidelberg
-
Ateniese, G., Song, D.X., Tsudik, G.: Quasi-efficient revocation in group signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 183-197. Springer, Heidelberg (2003)
-
(2003)
FC 2002. LNCS
, vol.2357
, pp. 183-197
-
-
Ateniese, G.1
Song, D.X.2
Tsudik, G.3
-
4
-
-
35248843604
-
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
-
Biham, E. (ed.) Springer, Heidelberg
-
Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: Formal defini-tions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614-629. Springer, Heidelberg (2003)
-
(2003)
EUROCRYPT 2003. LNCS
, vol.2656
, pp. 614-629
-
-
Bellare, M.1
Micciancio, D.2
Warinschi, B.3
-
5
-
-
34547339273
-
Multi-signatures in the plain public-key model and a general forking lemma
-
October/November
-
Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: ACM CCS 2006, pp. 390-399 (October/November 2006)
-
(2006)
ACM CCS 2006
, pp. 390-399
-
-
Bellare, M.1
Neven, G.2
-
6
-
-
0027726717
-
Random oracles are practical: A paradigm for designing efficient protocols
-
November
-
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62-73 (November 1993)
-
(1993)
ACM CCS 1993
, pp. 62-73
-
-
Bellare, M.1
Rogaway, P.2
-
7
-
-
24144477851
-
Foundations of group signatures: The case of dynamic groups
-
Menezes, A. (ed.) Springer, Hei-delberg
-
Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: The case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136-153. Springer, Hei-delberg (2005)
-
(2005)
CT-RSA 2005. LNCS
, vol.3376
, pp. 136-153
-
-
Bellare, M.1
Shi, H.2
Zhang, C.3
-
8
-
-
84957693225
-
Chosen ciphertext attacks against protocols based on the RSA encryp-tion standard PKCS #1
-
Krawczyk, H. (ed.) Springer, Heidelberg
-
Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryp-tion standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 1-12. Springer, Heidelberg (1998)
-
(1998)
CRYPTO 1998. LNCS
, vol.1462
, pp. 1-12
-
-
Bleichenbacher, D.1
-
9
-
-
35048887476
-
Short group signatures
-
Franklin, M. (ed.) Springer, Heidelberg
-
Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
-
(2004)
CRYPTO 2004. LNCS
, vol.3152
, pp. 41-55
-
-
Boneh, D.1
Boyen, X.2
Shacham, H.3
-
10
-
-
14844309671
-
Group signatures with verifier-local revocation
-
October
-
Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM CCS 2004, pp. 168-177 (October 2004)
-
(2004)
ACM CCS 2004
, pp. 168-177
-
-
Boneh, D.1
Shacham, H.2
-
11
-
-
33746042155
-
Compact group signatures without random oracles
-
Vaudenay, S. (ed.) Springer, Heidelberg
-
Boyen, X., Waters, B.: Compact group signatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 427-444. Springer, Heidelberg (2006)
-
(2006)
EUROCRYPT 2006. LNCS
, vol.4004
, pp. 427-444
-
-
Boyen, X.1
Waters, B.2
-
12
-
-
37149007674
-
Full-domain subgroup hiding and constant-size group signatures
-
Okamoto, T., Wang, X. (eds.) Springer, Heidelberg
-
Boyen, X., Waters, B.: Full-domain subgroup hiding and constant-size group signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 1-15. Springer, Heidelberg (2007)
-
(2007)
PKC 2007. LNCS
, vol.4450
, pp. 1-15
-
-
Boyen, X.1
Waters, B.2
-
13
-
-
52149103884
-
A new direct anonymous attestation scheme from bilinear maps
-
Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Springer, Heidelberg
-
Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol. 4968, pp. 1-20. Springer, Heidelberg (2008)
-
(2008)
Trust 2008. LNCS
, vol.4968
, pp. 1-20
-
-
Brickell, E.1
Chen, L.2
Li, J.3
-
14
-
-
67650686038
-
On the portability of generalized schnorr proofs
-
Joux, A. (ed.) Springer, Heidelberg
-
Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 425-442. Springer, Heidelberg (2010)
-
(2009)
LNCS
, vol.5479
, Issue.2010
, pp. 425-442
-
-
Camenisch, J.1
Kiayias, A.2
Yung, M.3
-
15
-
-
84937428748
-
Dynamic accumulators and application to efficient revo-cation of anonymous credentials
-
Yung, M. (ed.) Springer, Heidelberg
-
Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revo-cation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61-76. Springer, Heidelberg (2002)
-
(2002)
CRYPTO 2002. LNCS
, vol.2442
, pp. 61-76
-
-
Camenisch, J.1
Lysyanskaya, A.2
-
16
-
-
35048845114
-
Signature schemes and anonymous credentials from bi-linear maps
-
Franklin, M. (ed.) Springer, Heidelberg
-
Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bi-linear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56-72. Springer, Heidelberg (2004)
-
(2004)
CRYPTO 2004. LNCS
, vol.3152
, pp. 56-72
-
-
Camenisch, J.1
Lysyanskaya, A.2
-
17
-
-
84958612917
-
Efficient group signature schemes for large groups (extended abstract)
-
Kaliski Jr., B.S. (ed.) Springer, Heidelberg
-
Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410-424. Springer, Heidelberg (1997)
-
(1997)
CRYPTO 1997. LNCS
, vol.1294
, pp. 410-424
-
-
Camenisch, J.1
Stadler, M.2
-
18
-
-
85024290278
-
Group signatures
-
Davies, D.W. (ed.) Springer, Heidelberg
-
Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257-265. Springer, Heidelberg (1991)
-
(1991)
EUROCRYPT 1991. LNCS
, vol.547
, pp. 257-265
-
-
Chaum, D.1
Van Heyst, E.2
-
19
-
-
34347393777
-
Identity-based key agreement protocols from pairings
-
Chen, L., Cheng, M., Smart, N.P: Identity-based key agreement protocols from pairings. International Journal of Information Security 6, 213-241 (2007)
-
(2007)
International Journal of Information Security
, vol.6
, pp. 213-241
-
-
Chen, L.1
Cheng, M.2
Smart, N.P.3
-
20
-
-
52149086372
-
Pairings in trusted computing (invited talk)
-
Galbraith, S.D., Paterson, K.G. (eds.) Springer, Heidelberg
-
Chen, L., Morrissey, P., Smart, N.P: Pairings in trusted computing (invited talk). In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 1-17. Springer, Heidelberg (2008)
-
(2008)
Pairing 2008. LNCS
, vol.5209
, pp. 1-17
-
-
Chen, L.1
Morrissey, P.2
Smart, N.P.3
-
21
-
-
77952991405
-
DAA: Fixing the pairing based protocols
-
Chen, L., Morrissey, P., Smart, N.P: DAA: Fixing the pairing based protocols. Cryptology ePrintArchive, Report 2009/198 (2009)
-
(2009)
Cryptology EPrintArchive, Report 2009/198
-
-
Chen, L.1
Morrissey, P.2
Smart, N.P.3
-
22
-
-
84957802212
-
Efficient zero-knowledge proofs of knowl-edge without intractability assumptions
-
Imai, H., Zheng, Y (eds.) Springer, Heidelberg
-
Cramer, R., Damga°rd, I., MacKenzie, P.D.: Efficient zero-knowledge proofs of knowl-edge without intractability assumptions. In: Imai, H., Zheng, Y (eds.) PKC 2000. LNCS, vol. 1751, pp. 354-372. Springer, Heidelberg (2000)
-
(2000)
PKC 2000. LNCS
, vol.1751
, pp. 354-372
-
-
Cramer, R.1
Damgard, I.2
MacKenzie, P.D.3
-
23
-
-
1842616017
-
Design and analysis ofpractical public-key encryption schemes se-cure against adaptive chosen ciphertext attack
-
Cramer, R., Shoup, V.: Design and analysis ofpractical public-key encryption schemes se-cure against adaptive chosen ciphertext attack. SIAM Journal on Computing 33(1), 167-226 (2003)
-
(2003)
SIAM Journal on Computing
, vol.33
, Issue.1
, pp. 167-226
-
-
Cramer, R.1
Shoup, V.2
-
24
-
-
84948970500
-
Efficient concurrent zero-knowledge in the auxiliary string model
-
Preneel, B. (ed.) Springer, Heidelberg
-
Damga°rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418-430. Springer, Heidelberg (2000)
-
(2000)
EUROCRYPT 2000. LNCS
, vol.1807
, pp. 418-430
-
-
Damgard, I.1
-
25
-
-
84887276320
-
Dynamic fully anonymous short group signatures
-
Nguyên, P.Q. (ed.) Springer, Heidel-berg
-
Delerablée, C., Pointcheval, D.: Dynamic fully anonymous short group signatures. In: Nguyên, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 193-210. Springer, Heidel-berg (2006)
-
(2006)
VIETCRYPT 2006. LNCS
, vol.4341
, pp. 193-210
-
-
Delerablée, C.1
Pointcheval, D.2
-
26
-
-
84990731886
-
How to prove yourself: Practical solutions to identification and signature problems
-
Odlyzko, A.M. (ed.) Springer, Heidelberg
-
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
-
(1987)
CRYPTO 1986. LNCS
, vol.263
, pp. 186-194
-
-
Fiat, A.1
Shamir, A.2
-
27
-
-
53249117524
-
Pairings for cryptographers
-
Galbraith, S.D., Paterson, K.G., Smart, N.P: Pairings for cryptographers. Discrete Applied Mathematics 156, 3113-3121 (2008)
-
(2008)
Discrete Applied Mathematics
, vol.156
, pp. 3113-3121
-
-
Galbraith, S.D.1
Paterson, K.G.2
Smart, N.P.3
-
28
-
-
0023985465
-
A digital signature scheme secure against adaptive chosen-message attacks
-
Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281-308 (1988)
-
(1988)
SIAM Journal on Computing
, vol.17
, Issue.2
, pp. 281-308
-
-
Goldwasser, S.1
Micali, S.2
Rivest, R.L.3
-
29
-
-
67651053584
-
Pseudonym systems
-
Heys, H.M., Adams, C.M. (eds.) Springer, Heidelberg
-
Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, pp. 184-199. Springer, Heidelberg (2000)
-
(2000)
SAC 1999. LNCS
, vol.1758
, pp. 184-199
-
-
Lysyanskaya, A.1
Rivest, R.L.2
Sahai, A.3
Wolf, S.4
-
30
-
-
0000901529
-
Security arguments for digital signatures and blind signatures
-
Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal ofCryptology 13(3), 361-396 (2000)
-
(2000)
Journal OfCryptology
, vol.13
, Issue.3
, pp. 361-396
-
-
Pointcheval, D.1
Stern, J.2
-
33
-
-
0344628463
-
Accumulating composites and improved group signing
-
Laih, C.-S. (ed.) Springer, Heidelberg
-
Tsudik, G., Xu, S.: Accumulating composites and improved group signing. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 269-286. Springer, Heidelberg (2003)
-
(2003)
ASIACRYPT 2003. LNCS
, vol.2894
, pp. 269-286
-
-
Tsudik, G.1
Xu, S.2
|