메뉴 건너뛰기




Volumn 2442, Issue , 2002, Pages 93-110

Flaws in applying proof methodologies to signature schemes

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; NETWORK SECURITY;

EID: 84937411969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_7     Document Type: Conference Paper
Times cited : (67)

References (30)
  • 2
    • 84957629783 scopus 로고    scopus 로고
    • Relations among Notions of Security for Public-Key Encryption Schemes
    • Springer-Verlag
    • M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among Notions of Security for Public-Key Encryption Schemes. In Crypto ’98, LNCS 1462, pages 26–45, Springer-Verlag, 1998
    • (1998) Crypto ’98, LNCS , vol.1462 , pp. 26-45
    • Bellare, M.1    Desai, A.2    Pointcheval, D.3    Rogaway, P.4
  • 3
    • 0027726717 scopus 로고
    • Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols
    • ACM Press
    • M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCS, pages 62–73, ACM Press, 1993
    • (1993) Proc. Of the 1St CCS , pp. 62-73
    • Bellare, M.1    Rogaway, P.2
  • 4
    • 84948986458 scopus 로고
    • Optimal Asymmetric Encryption – How to Encrypt with RSA
    • Springer-Verlag
    • M. Bellare and P. Rogaway. Optimal Asymmetric Encryption – How to Encrypt with RSA. In Eurocrypt ’94, LNCS 950, pages 92–111, Springer-Verlag, 1995
    • (1995) Eurocrypt ’94, LNCS , vol.950 , pp. 92-111
    • Bellare, M.1    Rogaway, P.2
  • 5
    • 3743146243 scopus 로고
    • An Attack on a Signature Scheme proposed by Okamoto and Shiraishi
    • Springer-Verlag
    • E. Brickell and J. M. DeLaurentis. An Attack on a Signature Scheme proposed by Okamoto and Shiraishi. In Crypto ’85, LNCS 218, pages 28–32, Springer-Verlag, 1986
    • (1986) Crypto ’85, LNCS , vol.218 , pp. 28-32
    • Brickell, E.1    Delaurentis, J.M.2
  • 6
    • 84957808681 scopus 로고    scopus 로고
    • Design Validations for Discrete Logarithm Based Signature Schemes
    • Springer-Verlag
    • E. Brickell, D. Pointcheval, S. Vaudenay, and M. Yung. Design Validations for Discrete Logarithm Based Signature Schemes. In PKC ’2000, LNCS 1751, pages 276–292, Springer-Verlag, 2000
    • (2000) PKC ’2000, LNCS , vol.1751 , pp. 276-292
    • Brickell, E.1    Pointcheval, D.2    Vaudenay, S.3    Yung, M.4
  • 8
    • 0031619016 scopus 로고    scopus 로고
    • The Random Oracles Methodology, Revisited
    • ACM Press
    • R. Canetti, O. Goldreich, and S. Halevi. The Random Oracles Methodology, Revisited. In Proc. of the 30th STOC, pages 209–218, ACM Press, 1998
    • (1998) Proc. Of the 30Th STOC , pp. 209-218
    • Canetti, R.1    Goldreich, O.2    Halevi, S.3
  • 10
    • 84874800178 scopus 로고
    • A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
    • T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory, IT–31(4):469–472, July 1985
    • (1985) IEEE Transactions on Information Theory , vol.IT31 , Issue.4 , pp. 469-472
    • Elgamal, T.1
  • 11
    • 84990731886 scopus 로고
    • How to Prove Yourself: Practical Solutions of Identification and Signature Problems
    • Springer-Verlag
    • A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions of Identification and Signature Problems. In Crypto ’86, LNCS 263, pages 186–194, Springer-Verlag, 1987
    • (1987) Crypto ’86, LNCS , vol.263 , pp. 186-194
    • Fiat, A.1    Shamir, A.2
  • 12
    • 84880853825 scopus 로고    scopus 로고
    • RSA–OAEP is Secure under the RSA Assumption
    • Springer- Verlag
    • E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA–OAEP is Secure under the RSA Assumption. In Crypto ’2001, LNCS 2139, pages 260–274, Springer- Verlag, 2001
    • (2001) Crypto ’2001, LNCS , vol.2139 , pp. 260-274
    • Fujisaki, E.1    Okamoto, T.2    Pointcheval, D.3    Stern, J.4
  • 13
    • 0021941417 scopus 로고
    • The Knowledge Complexity of Interactive Proof Systems
    • ACM Press
    • S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. In Proc. of the 17th STOC, pages 291–304, ACM Press, 1985
    • (1985) Proc. Of the 17Th STOC , pp. 291-304
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 14
    • 0023985465 scopus 로고
    • A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks
    • S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281–308, April 1988
    • (1988) SIAM Journal of Computing , vol.17 , Issue.2 , pp. 281-308
    • Goldwasser, S.1    Micali, S.2    Rivest, R.3
  • 15
    • 84937505028 scopus 로고    scopus 로고
    • How to repair ESIGN
    • L. Granboulan. How to repair ESIGN. NESSIE internal document, may 2002. See http://www.cryptonessie.org/.Document NES/DOC/ENS/WP5/019
    • (2002) NESSIE Internal Document
    • Granboulan, L.1
  • 18
    • 0024983231 scopus 로고
    • Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
    • ACM Press
    • M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In Proc. of the 22nd STOC, pages 427–437. ACM Press, 1990
    • (1990) Proc. Of the 22Nd STOC , pp. 427-437
    • Naor, M.1    Yung, M.2
  • 19
    • 0010227312 scopus 로고
    • Complexity of a Determinate Algorithm for the Discrete Logarithm
    • V. I. Nechaev. Complexity of a Determinate Algorithm for the Discrete Logarithm. Mathematical Notes, 55(2):165-172, 1994
    • (1994) Mathematical Notes , vol.55 , Issue.2 , pp. 165-172
    • Nechaev, V.I.1
  • 20
    • 0003508562 scopus 로고    scopus 로고
    • NIST, Federal Information Processing Standards Publication 186, November 1994. Revision (To include ECDSA)
    • NIST. Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186, November 1994. Revision (To include ECDSA): 186-2, January 2000
    • (2000) Digital Signature Standard (DSS) , pp. 186-192
  • 21
    • 0003629991 scopus 로고
    • NIST, Federal Information Processing Standards Publication
    • NIST. Secure Hash Standard (SHS). Federal Information Processing Standards Publication 180–1, April 1995
    • (1995) Secure Hash Standard (SHS) , pp. 180-181
  • 22
    • 13844265517 scopus 로고    scopus 로고
    • TSH-ESIGN: Efficient Digital Signature Scheme Using Trisection Size Hash
    • T. Okamoto, E. Fujisaki and H. Morita. TSH-ESIGN: Efficient Digital Signature Scheme Using Trisection Size Hash, 1998. IEEE 1363 [16].
    • (1998) IEEE , vol.1363 , Issue.16
    • Okamoto, T.1    Fujisaki, E.2    Morita, H.3
  • 23
    • 84966238549 scopus 로고
    • Monte Carlo Methods for Index Computation (Mod p)
    • J. M. Pollard. Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32(143):918–924, July 1978
    • (1978) Mathematics of Computation , vol.32 , Issue.143 , pp. 918-924
    • Pollard, J.M.1
  • 24
    • 84974554584 scopus 로고
    • Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
    • C. Rackoff and D. R. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Crypto ’91, LNCS 576, pages 433–444. Springer- Verlag, 1992
    • (1992) Crypto ’91, LNCS , vol.576 , pp. 433-444
    • Rackoff, C.1    Simon, D.R.2
  • 25
    • 0017930809 scopus 로고
    • A Method for Obtaining Digital Signatures and Public Key Cryptosystems
    • R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 21(2):120–126, February 1978
    • (1978) Communications of the ACM , vol.21 , Issue.2 , pp. 120-126
    • Rivest, R.1    Shamir, A.2    Adleman, L.3
  • 26
    • 12344258539 scopus 로고
    • Efficient Signature Generation by Smart Cards
    • C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161–174, 1991
    • (1991) Journal of Cryptology , vol.4 , Issue.3 , pp. 161-174
    • Schnorr, C.P.1
  • 27
    • 84937417404 scopus 로고    scopus 로고
    • Security of Signed ElGamal Encryption
    • C. P. Schnorr and M. Jakobsson. Security of Signed ElGamal Encryption. In Asiacrypt ’2000, LNCS 1976, pages 458–469, Springer-Verlag, 2000
    • (2000) Asiacrypt ’2000, LNCS , vol.1976 , pp. 458-469
    • Schnorr, C.P.1    Jakobsson, M.2
  • 28
    • 84942550160 scopus 로고    scopus 로고
    • Lower Bounds for Discrete Logarithms and Related Problems
    • V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Eurocrypt ’97, LNCS 1233, pages 256–266, Springer-Verlag, 1997
    • (1997) Eurocrypt ’97, LNCS , vol.1233 , pp. 256-266
    • Shoup, V.1
  • 29
    • 84880904783 scopus 로고    scopus 로고
    • OAEP Reconsidered
    • V. Shoup. OAEP Reconsidered. In Crypto ’2001, LNCS 2139, pages 239–259, Springer-Verlag, 2001
    • (2001) Crypto ’2001, LNCS , vol.2139 , pp. 239-259
    • Shoup, V.1
  • 30
    • 84969374420 scopus 로고
    • How to break Okamoto’s Cryptosystem by Reducing Lattice Bases
    • B. Vallée, M. Girault and P. Toffin. How to break Okamoto’s Cryptosystem by Reducing Lattice Bases. In Eurocrypt ’88, LNCS 330, pages 281–292, Springer- Verlag, 1988.
    • (1988) Eurocrypt ’88, LNCS , vol.330 , pp. 281-292
    • Vallée, B.1    Girault, M.2    Toffin, P.3


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