메뉴 건너뛰기




Volumn 5461, Issue , 2009, Pages 368-382

On Formal Verification of Arithmetic-Based Cryptographic Primitives

Author keywords

Cryptographic primitives; CSPRBG; Machine formalization; Semantic security

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; CRYPTOGRAPHIC SCHEMES; CSPRBG; FORMAL VERIFICATIONS; HARD PROBLEMS; INFORMATION SECURITY; MACHINE FORMALIZATION; PROOF ASSISTANT; PSEUDO RANDOM; PUBLIC KEYS; PUBLIC-KEY CRYPTOSYSTEMS; SECURITY PROOFS; SEMANTIC SECURITY;

EID: 67049117699     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00730-9_23     Document Type: Conference Paper
Times cited : (10)

References (17)
  • 1
    • 38149007757 scopus 로고    scopus 로고
    • Affeldt, R., Tanaka, M., Marti, N.: Formal proof of provable security by game- playing in a proof assistant. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, 4784, pp. 151-168. Springer, Heidelberg (2007)
    • Affeldt, R., Tanaka, M., Marti, N.: Formal proof of provable security by game- playing in a proof assistant. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol. 4784, pp. 151-168. Springer, Heidelberg (2007)
  • 4
    • 38149024828 scopus 로고    scopus 로고
    • Code-based game-playing proofs and the security of triple encryption. Cryptology ePrint Archive
    • Report 2004/331
    • Bellare, M., Rogaway, P.: Code-based game-playing proofs and the security of triple encryption. Cryptology ePrint Archive, Report 2004/331 (2004)
    • (2004)
    • Bellare, M.1    Rogaway, P.2
  • 5
    • 0034822279 scopus 로고    scopus 로고
    • An efficient cryptographic protocol verifier based on Prolog rules
    • IEEE Computer Society, Los Alamitos
    • Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW- 14), pp. 82-96. IEEE Computer Society, Los Alamitos (2001)
    • (2001) Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW , vol.14 , pp. 82-96
    • Blanchet, B.1
  • 6
    • 33749579704 scopus 로고    scopus 로고
    • Automated security proofs with sequences of games
    • Dwork, C, ed, CRYPTO 2006, Springer, Heidelberg
    • Blanchet, B., Pointcheval, D.: Automated security proofs with sequences of games. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 537-554. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4117 , pp. 537-554
    • Blanchet, B.1    Pointcheval, D.2
  • 7
    • 0022716288 scopus 로고
    • A simple unpredictable pseudo random number generator. SIAM Journal on Computing 15(2), 364-383 (1986)
    • Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM Journal on Computing 15(2), 364-383 (1986); an earlier version appeared in Proceedings of Crypto 1982
    • (1982) an earlier version appeared in Proceedings of Crypto
    • Blum, L.1    Blum, M.2    Shub, M.3
  • 9
    • 38049031798 scopus 로고    scopus 로고
    • Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Thery, L.: A modular formal- isation of finite group theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, 4732, pp. 86-101. Springer, Heidelberg (2007)
    • Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Thery, L.: A modular formal- isation of finite group theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 86-101. Springer, Heidelberg (2007)
  • 10
    • 33746336609 scopus 로고    scopus 로고
    • A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive
    • Report 2005/181
    • Halevi, S.: A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive, Report 2005/181 (2005)
    • (2005)
    • Halevi, S.1
  • 13
    • 38148999450 scopus 로고    scopus 로고
    • Nowak, D.: A framework for game-based security proofs. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, 4861, pp. 319-333. Springer, Heidelberg (2007); also available as Cryptology ePrint Archive, Report 2007/199
    • Nowak, D.: A framework for game-based security proofs. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 319-333. Springer, Heidelberg (2007); also available as Cryptology ePrint Archive, Report 2007/199
  • 15
    • 33745142417 scopus 로고    scopus 로고
    • Sequences of games: A tool for taming complexity in security proofs. Cryptology ePrint Archive
    • Report 2004/332
    • Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332 (2004)
    • (2004)
    • Shoup, V.1
  • 16
    • 0021548502 scopus 로고
    • Efficient and secure pseudo-random number generation. In: Proceedings of the IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
    • Vazirani, U.V., Vazirani, V.V.: Efficient and secure pseudo-random number generation. In: Proceedings of the IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), pp. 458-463. IEEE Computer Society, Los Alami- tos (1984)
    • (1984) IEEE Computer Society, Los Alami- tos , pp. 458-463
    • Vazirani, U.V.1    Vazirani, V.V.2


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