메뉴 건너뛰기




Volumn 17, Issue , 2004, Pages 280-291

Symbolic model checking the knowledge of the Dining Cryptographers

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SPECIFICATIONS;

EID: 4944250729     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (103)

References (32)
  • 3
    • 84961326491 scopus 로고    scopus 로고
    • A model checking algorithm for multi-agent systems
    • J. Muller, M. Singh, and A. Rao, editors. volume LNAI Springer-Verlag, Berlin
    • M. Benerecetti, F. Giunchiglia, and L. Serafini. A model checking algorithm for multi-agent systems. In J. Muller, M. Singh, and A. Rao, editors, Intelligent Agents V, volume LNAI Vol. 1555. Springer-Verlag, Berlin, 1999.
    • (1999) Intelligent Agents V , vol.1555
    • Benerecetti, M.1    Giunchiglia, F.2    Serafini, L.3
  • 6
    • 0023861309 scopus 로고
    • The dining cryptographers problem: Unconditional sender and recipient untraceability
    • D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. J., Cryptology, (1):65-75, 1988.
    • (1988) J., Cryptology , Issue.1 , pp. 65-75
    • Chaum, D.1
  • 8
    • 4944219824 scopus 로고    scopus 로고
    • A machine checkable logic of knowledge for specifying security properties of electronic commerce protocols
    • E. Clarke, S. Jha, and W. Marrero. A machine checkable logic of knowledge for specifying security properties of electronic commerce protocols. In LICS Security Workshop, 1998.
    • (1998) LICS Security Workshop
    • Clarke, E.1    Jha, S.2    Marrero, W.3
  • 9
    • 0020720357 scopus 로고
    • On the security of public-key protocols
    • August
    • D. Dolev and A. Yao. On the security of public-key protocols. Communications of the ACM, 29(8):198-208, August 1983.
    • (1983) Communications of the ACM , vol.29 , Issue.8 , pp. 198-208
    • Dolev, D.1    Yao, A.2
  • 11
    • 4944262982 scopus 로고    scopus 로고
    • Herbivore: A scalable and efficient protocol for anonymous communication
    • Cornell University Computing and Information Science, Feb
    • S. Goel, M. Robson, M. Polte, and E. G. Sirer. Herbivore: A scalable and efficient protocol for anonymous communication. Technical Report TR2003-1890, Cornell University Computing and Information Science, Feb 2003.
    • (2003) Technical Report , vol.TR2003-1890
    • Goel, S.1    Robson, M.2    Polte, M.3    Sirer, E.G.4
  • 12
    • 38349081753 scopus 로고    scopus 로고
    • Implementation of belief change operators using bdds
    • N. Gorogiannis and M. D. Ryan. Implementation of belief change operators using bdds. Studia Logica, 70(1), 2001.
    • (2001) Studia Logica , vol.70 , Issue.1
    • Gorogiannis, N.1    Ryan, M.D.2
  • 13
    • 0025460546 scopus 로고
    • Knowledge and common knowledge in a distributed environment
    • J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment J. ACM, 37(3):549-587, 1990.
    • (1990) J. ACM , vol.37 , Issue.3 , pp. 549-587
    • Halpern, J.1    Moses, Y.2
  • 14
    • 0001967875 scopus 로고
    • Model checking vs. theorem proving: A manifesto
    • IBM Al-maden Research Center
    • J. Halpern and M. Y. Vardi. Model checking vs. theorem proving: A manifesto. Technical Report RJ 7963, IBM Al-maden Research Center, 1991. An extended version of a paper in Proc. 2nd Int. Conf. on Principles of Knowledge Representation and Reasoning, 1991.
    • (1991) Technical Report , vol.RJ 7963
    • Halpern, J.1    Vardi, M.Y.2
  • 17
    • 0027665952 scopus 로고
    • Knowledge, probability, and adversaries
    • J. Y. Halpern and M. R. Tuttle. Knowledge, probability, and adversaries. J. ACM, 40(4):917-962, 1993. A preliminary version appears in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 103-118.
    • (1993) J. ACM , vol.40 , Issue.4 , pp. 917-962
    • Halpern, J.Y.1    Tuttle, M.R.2
  • 22
    • 0342658605 scopus 로고    scopus 로고
    • Breaking and fixing the Needham-Schroeder public-key protocol using FDR
    • Margaria and Steffen, editors, Lecture Notes in Computer Science. Springer Verlag
    • G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Margaria and Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems, Vol 1055 of Lecture Notes in Computer Science, pages 147-166. Springer Verlag, 1996.
    • (1996) Tools and Algorithms for the Construction and Analysis of Systems , vol.1055 , pp. 147-166
    • Lowe, G.1
  • 24
    • 0346338341 scopus 로고    scopus 로고
    • Common knowledge and update in finite environments
    • R. van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1998. A preliminary version of this paper appears in Proc. Conf on Theoretical Aspects of Reasoning about Knowledge, 1994.
    • (1998) Information and Computation , vol.140 , Issue.2 , pp. 115-157
    • Van Der Meyden, R.1
  • 25
    • 0346338341 scopus 로고    scopus 로고
    • R. van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1998. A preliminary version of this paper appears in Proc. Conf on Theoretical Aspects of Reasoning about Knowledge, 1994.
    • (1994) Proc. Conf on Theoretical Aspects of Reasoning about Knowledge
  • 32
    • 85051051500 scopus 로고
    • Expressing interesting properties of programs in prepositional temporal logic
    • St. Petersburgh, January
    • P. Wolper. Expressing interesting properties of programs in prepositional temporal logic. In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 184-192, St. Petersburgh, January 1986.
    • (1986) Proc. 13th ACM Symp. on Principles of Programming Languages , pp. 184-192
    • Wolper, P.1


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