메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 4575 LNCS, Issue , 2007, Pages 268-292
Fair blind signatures revisited
Author keywords

Anonymity revocation; Blind signatures; Electronic voting; Security model
Indexed keywords

ANONYMITY REVOCATION; BILINEAR MAPS; BLIND SIGNATURE SCHEME; BLIND SIGNATURES; ELECTRONIC VOTING; FAIR BLIND SIGNATURES; FORMAL MODELING; INTERNATIONAL CONFERENCES; PAIRING-BASED CRYPTOGRAPHY; PROVABLY SECURE; RANDOM ORACLE MODELS; SECURITY MODEL; SECURITY MODELING; STADLER; TWO TYPES; UNFORGEABILITY;
EID: 50049096014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73489-5_14     Document Type: Conference Paper
Times cited : (11)
References (38)
  • 1
    • 84945119655 scopus 로고    scopus 로고
    • A three-move blind signature scheme for polynomially many signatures
    • Eurocrypt '01, of
    • M. Abe. A three-move blind signature scheme for polynomially many signatures. In Eurocrypt '01, volume 2045 of Lecture Notes in Computer Science, pages 136-151, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2045 , pp. 136-151
    • Abe, M.1
  • 3
    • 84946829122 scopus 로고    scopus 로고
    • Provably secure fair blind signatures with tight revocation
    • Asiacrypt '01, of
    • M. Abe and M. Ohkubo. Provably secure fair blind signatures with tight revocation. In Asiacrypt '01, volume 2248 of Lecture Notes in Computer Science, pages 583-601, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2248 , pp. 583-601
    • Abe, M.1    Ohkubo, M.2
  • 4
    • 84974652864 scopus 로고    scopus 로고
    • Provably secure partially blind signatures
    • CRYPTO 2000, of
    • M. Abe and T.Okamoto. Provably secure partially blind signatures. In CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 271-286, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1880 , pp. 271-286
    • Abe, M.1    Okamoto, T.2
  • 5
    • 35248843604 scopus 로고    scopus 로고
    • Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
    • EUROCRYPT 2003, of
    • M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 614-629, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2656 , pp. 614-629
    • Bellare, M.1    Micciancio, D.2    Warinschi, B.3
  • 6
    • 20544449100 scopus 로고    scopus 로고
    • The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
    • M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme. J. Cryptology, 16(3):185-215, 2003.
    • (2003) J. Cryptology , vol.16 , Issue.3 , pp. 185-215
    • Bellare, M.1    Namprempre, C.2    Pointcheval, D.3    Semanko, M.4
  • 7
    • 24144477851 scopus 로고    scopus 로고
    • Foundations of group signatures: The case of dynamic groups
    • CT-RSA 2005, of
    • M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: The case of dynamic groups. In CT-RSA 2005, volume 3376 of Lecture Notes in Computer Science, pages 136-153, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3376 , pp. 136-153
    • Bellare, M.1    Shi, H.2    Zhang, C.3
  • 9
    • 84995460223 scopus 로고
    • Trustee-based tracing extension to anonymous cash and the making of anonymous change
    • ACM Press
    • E. Brickell, P. Gemmel, and D. Kravitz. Trustee-based tracing extension to anonymous cash and the making of anonymous change. In 6th ACM-SIAM, pages 457-466. ACM Press, 1995.
    • (1995) 6th ACM-SIAM , pp. 457-466
    • Brickell, E.1    Gemmel, P.2    Kravitz, D.3
  • 10
    • 23944509128 scopus 로고    scopus 로고
    • Efficient blind signatures without random oracles
    • J. Camenisch, M. Koprowski, and B. Warinschi. Efficient blind signatures without random oracles. In SCN, pages 134-148, 2004.
    • (2004) SCN , pp. 134-148
    • Camenisch, J.1    Koprowski, M.2    Warinschi, B.3
  • 11
    • 35048845114 scopus 로고    scopus 로고
    • Signature schemes and anonymous credentials from bilinear maps
    • Crypto 04, of
    • J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In Crypto 04, volume 3152 of Lecture Notes in Computer Science, pages 56-72, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3152 , pp. 56-72
    • Camenisch, J.1    Lysyanskaya, A.2
  • 12
    • 84949745296 scopus 로고    scopus 로고
    • Digital payment systems with passive anonymity-revoking trustees
    • J. Camenisch, U. M. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In ESORICS, volume 1146, pages 33-43, 1996.
    • (1996) ESORICS , vol.1146 , pp. 33-43
    • Camenisch, J.1    Maurer, U.M.2    Stadler, M.3
  • 13
    • 50049131117 scopus 로고    scopus 로고
    • Defeating malicious servers in a blind signatures based voting system
    • S. Canard, M. Gaud, and J. Traoré. Defeating malicious servers in a blind signatures based voting system. In Financial Cryptography 2006, 2006.
    • (2006) Financial Cryptography 2006
    • Canard, S.1    Gaud, M.2    Traoré, J.3
  • 14
    • 0003062028 scopus 로고
    • Blind signatures for untraceable payments
    • Crypto '83
    • D. Chaum. Blind signatures for untraceable payments. In Crypto '83, Lecture Notes in Computer Science, page 153, 1984.
    • (1984) Lecture Notes in Computer Science , pp. 153
    • Chaum, D.1
  • 15
    • 84948970500 scopus 로고    scopus 로고
    • Efficient concurrent zero-knowledge in the auxiliary string model
    • EUROCRYPT 2000, Proceeding, of
    • I. Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, Proceeding, volume 1807 of Lecture Notes in Computer Science, pages 418-430, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1807 , pp. 418-430
    • Damgård, I.1
  • 16
    • 84958062298 scopus 로고    scopus 로고
    • An efficient fair off-line electronic cash system with extensions to checks and wallets with observers
    • Financial Cryptography'98, Proceedings, of
    • A. die Solages and J. Traoré. An efficient fair off-line electronic cash system with extensions to checks and wallets with observers. In Financial Cryptography'98, Proceedings, volume 1465 of Lecture Notes in Computer Science, pages 275-295, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1465 , pp. 275-295
    • die Solages, A.1    Traoré, J.2
  • 17
    • 84990731886 scopus 로고
    • How to prove yourself: Pratical solutions of identifications and signature problems
    • CRYPTO '86, Proceedings, of
    • A. Fiat and A. Shamir. How to prove yourself: Pratical solutions of identifications and signature problems. In CRYPTO '86, Proceedings, volume 263 of Lecture Notes in Computer Science, pages 186-194, 1986.
    • (1986) Lecture Notes in Computer Science , vol.263 , pp. 186-194
    • Fiat, A.1    Shamir, A.2
  • 18
    • 33749544519 scopus 로고    scopus 로고
    • Round-optimal composable blind signatures in the common reference string model
    • CRYPTO'06, of
    • M. Fischlin, Round-optimal composable blind signatures in the common reference string model. In CRYPTO'06, volume 4117 of Lecture Notes in Computer Science, pages 60-77, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4117 , pp. 60-77
    • Fischlin, M.1
  • 19
    • 84946827596 scopus 로고    scopus 로고
    • Threshold cryptosystems secure against chosen-ciphertext attacks
    • ASIACRYPT 2001, Proceedings, of
    • P.-A. Fouque and D. Pointcheval. Threshold cryptosystems secure against chosen-ciphertext attacks. In ASIACRYPT 2001, Proceedings, volume 2248 of Lecture Notes in Computer Science, pages 351-368, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2248 , pp. 351-368
    • Fouque, P.-A.1    Pointcheval, D.2
  • 20
    • 84955560661 scopus 로고    scopus 로고
    • indirect discourse proof: Achieving efficient fair off-line e-cash
    • ASIACRYPT '96, Proceedings, of
    • Y. Frankel, Y. Tsiounis, and M. Yung, "indirect discourse proof": Achieving efficient fair off-line e-cash. In ASIACRYPT '96, Proceedings, volume 1163 of Lecture Notes in Computer Science, pages 286-300, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1163 , pp. 286-300
    • Frankel, Y.1    Tsiounis, Y.2    Yung, M.3
  • 21
    • 77954124943 scopus 로고
    • A practical secret voting scheme for large scale elections
    • ASIACRYPT '92, Proceedings, of
    • A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In ASIACRYPT '92, Proceedings, volume 718 of Lecture Notes in Computer Science, pages 244-251, 1992.
    • (1992) Lecture Notes in Computer Science , vol.718 , pp. 244-251
    • Fujioka, A.1    Okamoto, T.2    Ohta, K.3
  • 22
    • 33646074217 scopus 로고    scopus 로고
    • On the anonymity of fair online e-cash systems
    • M. Gaud and J. Traoré. On the anonymity of fair online e-cash systems. In Financial Cryptography, pages 34-50, 2003.
    • (2003) Financial Cryptography , pp. 34-50
    • Gaud, M.1    Traoré, J.2
  • 23
    • 50049088242 scopus 로고    scopus 로고
    • Concurrently-secure blind signatures without random oracles or setup assumptions
    • to appear
    • C. Hazay, C.-Y. Koo, and Y. Lindell. Concurrently-secure blind signatures without random oracles or setup assumptions. In TCC'07, to appear, 2007.
    • (2007) TCC'07
    • Hazay, C.1    Koo, C.-Y.2    Lindell, Y.3
  • 24
    • 84958591696 scopus 로고    scopus 로고
    • Security of blind digital signatures (extended abstract)
    • CRYPTO '97,Proceedings, of
    • A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures (extended abstract). In CRYPTO '97,Proceedings, volume 1294 of Lecture Notes in Computer Science, pages 150-164, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1294 , pp. 150-164
    • Juels, A.1    Luby, M.2    Ostrovsky, R.3
  • 25
    • 35048841283 scopus 로고    scopus 로고
    • Traceable signatures
    • EUROCRYPT 2004, Proceedings, of
    • A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. In EUROCRYPT 2004, Proceedings, volume 3027 of Lecture Notes in Computer Science, pages 571-589, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3027 , pp. 571-589
    • Kiayias, A.1    Tsiounis, Y.2    Yung, M.3
  • 26
    • 33750018910 scopus 로고    scopus 로고
    • A. Kiayias and H.-S. Zhou. Concurrent blind signatures without random oracles. In SCN, 4116 of Lecture Notes in Computer Science, pages 49-62, 2006.
    • A. Kiayias and H.-S. Zhou. Concurrent blind signatures without random oracles. In SCN, volume 4116 of Lecture Notes in Computer Science, pages 49-62, 2006.
  • 27
    • 84958601057 scopus 로고    scopus 로고
    • A key recovery attack on discrete log-based schemes using a prime order subgroup
    • CRYPTO '97,Proceedings, of
    • C. Hoon Lim and P. Joong Lee. A key recovery attack on discrete log-based schemes using a prime order subgroup. In CRYPTO '97,Proceedings, volume 1294 of Lecture Notes in Computer Science, pages 249-63, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1294 , pp. 249-263
    • Hoon Lim, C.1    Joong Lee, P.2
  • 29
    • 33745554010 scopus 로고    scopus 로고
    • T. Okamoto. Efficient blind and partially blind signatures without random oracles. In Theory of Cryptography, Proceedings, 3876 of Lecture Notes in Computer Science, pages 80-99, 2006. Revisited version Cryptology ePrint Archive, Report 2006/102 http://eprint.iacr.org/.
    • T. Okamoto. Efficient blind and partially blind signatures without random oracles. In Theory of Cryptography, Proceedings, volume 3876 of Lecture Notes in Computer Science, pages 80-99, 2006. Revisited version Cryptology ePrint Archive, Report 2006/102 http://eprint.iacr.org/.
  • 30
    • 85027134285 scopus 로고
    • An efficient digital signature scheme based on an elliptic curve over the ring zn
    • CRYPTO '92, Proceedings, of
    • T. Okamoto, A. Fujioka, and E. Fujisaki. An efficient digital signature scheme based on an elliptic curve over the ring zn. In CRYPTO '92, Proceedings, volume 740 of Lecture Notes in Computer Science, pages 54-65, 1992.
    • (1992) Lecture Notes in Computer Science , vol.740 , pp. 54-65
    • Okamoto, T.1    Fujioka, A.2    Fujisaki, E.3
  • 31
    • 85032864442 scopus 로고
    • Divertible zero knowledge interactive proofs and commutative random self-reducibility
    • EUROCRYPT '89,Proceedings, of
    • T. Okamoto and K. Ohta. Divertible zero knowledge interactive proofs and commutative random self-reducibility. In EUROCRYPT '89,Proceedings, volume 434 of Lecture Notes in Computer Science, pages 134-148, 1989.
    • (1989) Lecture Notes in Computer Science , vol.434 , pp. 134-148
    • Okamoto, T.1    Ohta, K.2
  • 32
    • 84942550998 scopus 로고    scopus 로고
    • Public-key cryptosystems based on composite degree residuoisity classes
    • EUROCRYPT '99, Proceeding, of
    • P. Paillier. Public-key cryptosystems based on composite degree residuoisity classes. In EUROCRYPT '99, Proceeding, volume 1592 of Lecture Notes in Computer Science, pages 129-140, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1592 , pp. 129-140
    • Paillier, P.1
  • 33
    • 84957717377 scopus 로고    scopus 로고
    • Strengthened security for blind signatures
    • EUROCRYPT '98, Proceeding, of
    • D. Pointcheval. Strengthened security for blind signatures. In EUROCRYPT '98, Proceeding, volume 1403 of Lecture Notes in Computer Science, pages 391-405, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1403 , pp. 391-405
    • Pointcheval, D.1
  • 34
    • 84955579666 scopus 로고    scopus 로고
    • Provably secure blind signature schemes
    • ASI-ACRYPT '96, Proceedings, of
    • D. Pointcheval and J. Stern. Provably secure blind signature schemes. In ASI-ACRYPT '96, Proceedings, volume 1163 of Lecture Notes in Computer Science, pages 252-265, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1163 , pp. 252-265
    • Pointcheval, D.1    Stern, J.2
  • 35
    • 0000901529 scopus 로고    scopus 로고
    • Security arguments for digital signatures and blind signatures
    • D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.
    • (2000) Journal of Cryptology , vol.13 , Issue.3 , pp. 361-396
    • Pointcheval, D.1    Stern, J.2
  • 36
    • 12344258539 scopus 로고
    • Efficient signature generation by smart cards
    • C.-P. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4(3):161-174, 1991.
    • (1991) J. Cryptology , vol.4 , Issue.3 , pp. 161-174
    • Schnorr, C.-P.1
  • 38
    • 21944444217 scopus 로고    scopus 로고
    • Making unfair a "fair" blind signature scheme
    • J. Traoré. Making unfair a "fair" blind signature scheme. In ICICS'97, pages 386-397, 1997.
    • (1997) ICICS'97 , pp. 386-397
    • Traoré, J.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.