article

Free access

Secrecy by typing in security protocols

Author:

Martín AbadiAuthors Info & Claims

Journal of the ACM (JACM), Volume 46, Issue 5

Pages 749 - 786

https://doi.org/10.1145/324133.324266

Published: 01 September 1999 Publication History

PDF eReader

Abstract

We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use shared-key cryptography. The rules have the form of typing rules for a basic concurrent language with cryptographic primitives, the spi calculus. They guarantee that, if a protocol typechecks, then it does not leak its secret inputs.

References

[1]

ABADI, M. 1998. Protection in programming-language translations. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming, pp. 868-883.

Crossref

Google Scholar

[2]

ABADI, M., FOURNET, C., AND GONTHIER, G. 1998. Secure implementation of channel abstractions. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 105-116.

Crossref

Google Scholar

[3]

ABADI, M., AND GORDON, A. D. 1997a. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the 4th ACM Conference on Computer and Communications Security (Zurich, Switzerland, Apr. 1-4). ACM, New York, pp. 36-47.

Crossref

Google Scholar

[4]

ABADI, M., AND GORDON, A. D. 1997b. Reasoning about cryptographic protocols in the spi calculus. In CONCUR'97: Concurrency Theory. Lecture Notes in Computer Science, vol. 1243. Springer-Verlag, New York, pp. 59-73.

Crossref

Google Scholar

[5]

ABADI, M., AND GORDON, A. D. 1998. A bisimulation method for cryptographic protocols. Nord. J. Comput. 5, 4 (Winter), 267-303.

Crossref

Google Scholar

[6]

ABADI, M., AND GORDON, A. D. 1999. A calculus for crytographic protocols: The spi calculus. Inf. Comput. 148, 1 (Jan.), 1-70.

Crossref

Google Scholar

[7]

ABADI, M., AND NEEDHAM, R. 1996. Prudent engineering practice for cryptographic protocols. IEEE Trans. Softw. Eng. 22, 1 (Jan.), 6-15.

Crossref

Google Scholar

[8]

ANDERSON, R., AND NEEDHAM, R. 1995. Robustness principles for public key protocols. In Proceedings of Crypto '95. pp. 236-247.

Crossref

Google Scholar

[9]

AURA, T. 1997. Strategies against replay attacks. In Proceedings of the 10th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos, Calif., pp. 59-68.

Crossref

Google Scholar

[10]

BELLARE, M., AND ROGAWAY, P. 1995. Provably secure session key distribution-The three party case. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 57-66.

Crossref

Google Scholar

[11]

BODEI, C., DEGANO, P., NIELSON, F., AND NIELSON, H. R. 1998. Control flow analysis for the p-calculus. In CONCUR'98: Concurrency Theory, Lecture Notes in Computer Science, vol. 1466.

Crossref

Google Scholar

[12]

BOREALE, M., AND DE NICOLA, R. 1995. Testing equivalence for mobile processes. Inf. Comput. 120, 2 (Aug.), 279-303.

Crossref

Google Scholar

[13]

BURROWS, M., ABADI, M., AND NEEDHAM, R. M. 1989. A logic of authentication. Proc. Roy. Soc. London A 426, 233-271.

Google Scholar

[14]

CARDELLI, L., AND GORDON, A. D. 1998. Mobile ambients. In Foundations of Software Science and Computation Structures, First International Conference (FoSSaCS'98). Lecture Notes in Computer Science, (vol. 1378). Springer-Verlag, New York, pp. 140-155.

Crossref

Google Scholar

[15]

DAM, M. 1998. Proving trust in systems of second-order processes. In Proceedings of HICSS 31, vol. VII. pp. 255-264.

Crossref

Google Scholar

[16]

DENNING, D. E. 1982. Cryptography and Data Security. Addison-Wesley, Reading, Mass.

Crossref

Google Scholar

[17]

DE NICOLA, R., AND HENNESSY, M. C. B. 1984. Testing equivalences for processes. Theoret. Comput. Sci. 34, 83-133.

Google Scholar

[18]

FOCARDI, R., AND GORRIERI, R. 1994/1995. A classification of security properties. J. Comput. Sec. 3, 5-33.

Google Scholar

[19]

FOCARDI, R., AND GORRIERI, R. 1997. The compositional security checker: A tool for the verification of information flow security properties. IEEE Trans. Softw. Eng. 23, 9 (Sept.).

Crossref

Google Scholar

[20]

GASSER, M. 1988. Building a Secure Computer System. Van Nostrand Reinhold Company Inc., New York.

Crossref

Google Scholar

[21]

HEINTZE, N., AND RIECKE, J. G. 1998. The SLam calculus: Programming with secrecy and integrity. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Program-ming Languages (POPL '98). (San Diego, Calif., Jan. 19-21). ACM, New York, pp. 365-377.

Crossref

Google Scholar

[22]

KOBAYASHI, N., PIERCE,B.C.,AND TURNER, D. N. 1996. Linearity and the pi-calculus. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Lan-guages (POPL '96). (St. Petersburg Beach, Fla., Jan 21-24). ACM, New York, pp. 358-371.

Crossref

Google Scholar

[23]

LINCOLN, P., MITCHELL, J., MITCHELL, M., AND SCEDROV, A. 1998. A probabilistic poly-time framework for protocol analysis. In Proceedings of the 5th ACM Conference on Computer and Communications Security (San Francisco, Calif., Nov. 3-5). ACM, New York, pp. 112-121.

Crossref

Google Scholar

[24]

LINDHOLM, T., AND YELLIN, F. 1996. The Java Virtual Machine Specification. Addison-Wesley, Reading, Mass.

Crossref

Google Scholar

[25]

MENEZES,A.J.,VAN OORSCHOT,P.C.,AND VANSTONE, S. A. 1996. Handbook of Applied Cryptography. CRC Press.

Crossref

Google Scholar

[26]

MILNER, R. 1993. The polyadic p-calculus: A tutorial. In Logic and Algebra of Specification,F.L. Bauer, W. Brauer, and H. Schwichtenberg, eds. Springer-Verlag, New York.

Crossref

Google Scholar

[27]

MILNER, R. 1995. The p-calculus. Undergraduate lecture notes. Cambridge University, Cam-bridge, England.

Google Scholar

[28]

MILNER, R., PARROW, J., AND WALKER, D. 1992a. A calculus of mobile processes, Part I. Inf. Comput. 100, 1 (Sept.), 1-40.

Crossref

Google Scholar

[29]

MILNER, R., PARROW, J., AND WALKER, D. 1992b. A calculus of mobile processes, Part II. Inf. Comput. 100, 1 (Sept.). 41-77.

Crossref

Google Scholar

[30]

MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1998. From System F to typed assembly language. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Program-ming Languages (POPL '98). (San Diego, Calif., Jan. 19-21). ACM, New York, pp. 85-97.

Crossref

Google Scholar

[31]

MYERS,A.C.,AND LISKOV, B. 1997. A decentralized model for information flow control. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (Saint-Malo, France, Oct. 5-8). ACM, New York, pp. 129-142.

Crossref

Google Scholar

[32]

NATIONAL BUREAU OF STANDARDS. 1977. Data encryption standard. FIPS Pub. 46.

Google Scholar

[33]

NECULA, G. C. 1997. Proof-carrying code. In Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '97) (Paris, France, Jan. 15-17). ACM, New York, pp. 106-119.

Crossref

Google Scholar

[34]

NEEDHAM,R.M.,AND SCHROEDER, M. D. 1978. Using encryption for authentication in large networks of computers. Commun. ACM 21, 12 (Dec.), 993-999.

Crossref

Google Scholar

[35]

~RB~K, P., AND PALSBERG, J. 1997. Trust in the l-calculus. J. Funct. Prog. 7, 6 (Nov.), 557-591.

Crossref

Google Scholar

[36]

PAULSON, L. C. 1998. The inductive approach to verifying cryptographic protocols. J. Comput. Sec. 6, 1-2, 85-128.

Crossref

Google Scholar

[37]

PIERCE, B., AND SANGIORGI, D. 1996. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6, 5 (Oct.), 409-453.

Google Scholar

[38]

RIELY, J., AND HENNESSY, M. 1998. A typed language for distributed mobile processes. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Lan-guages (POPL '98) (San Diego, Calif., Jan. 19-21). ACM, New York, pp. 378-390.

Crossref

Google Scholar

[39]

SCHNEIER, B. 1996. Applied Cryptography: Protocols, Algorithms, and Source Code in C. 2nd ed. Wiley, New York.

Crossref

Google Scholar

[40]

SMITH, G., AND VOLPANO, D. 1998. Secure information flow in a multithreaded imperative language. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Program-ming Languages (POPL '98) (San Diego, Calif., Jan. 19-21). ACM, New York, pp. 355-364.

Crossref

Google Scholar

[41]

SYVERSON, P. 1996. Limitations on design principles for public key protocols. In Proceedings of the IEEE Symposium on Security and Privacy IEEE Computer Society Press, Los Alamitos, Calif., pp. 62-72.

Crossref

Google Scholar

[42]

TARDITI, D., MORRISETT, G., CHENG, P., STONE, C., HARPER, R., AND LEE, P. 1996. TIL: A type-directed optimizing compiler for ML. In Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation (PLDI). (Philadelphia, Pa., May 21-24). ACM, New York, pp. 181--192.

Crossref

Google Scholar

[43]

vVOLPANO, D., IRVINE, C., AND SMITH, G. 1996. A sound type system for secure flow analysis. J. Comput. Sec. 4, 167-187.

Crossref

Google Scholar

[44]

WOO,T.Y.C.,AND LAM, S. S. 1994. A lesson in authentication protocol design. ACM Oper. Syst. Rev. 28, 3, 24-37.

Crossref

Google Scholar

Cited By

View all

Nelson BPagnin EAskarov A(2024)Metadata Privacy Beyond Tunneling for Instant Messaging2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP60621.2024.00044(697-723)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSP60621.2024.00044
Linvill KKaki GWustrow E(2023)Verifying Indistinguishability of Privacy-Preserving ProtocolsProceedings of the ACM on Programming Languages10.1145/36228497:OOPSLA2(1442-1469)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622849
Patrignani MBlackshear S(2023)Robust Safety for Move2023 IEEE 36th Computer Security Foundations Symposium (CSF)10.1109/CSF57540.2023.00045(308-323)Online publication date: Jul-2023
https://doi.org/10.1109/CSF57540.2023.00045
Show More Cited By

Recommendations

Analyzing security protocols with secrecy types and logic programs

We study and further develop two language-based techniques for analyzing security protocols. One is based on a typed process calculus; the other, on untyped logic programs. Both focus on secrecy properties. We contribute to these two techniques, in ...
Security by typing

We present an approach for analyzing cryptographic protocols that are subject to attack from an active intruder who takes advantage of knowledge of the protocol rules. The approach uses a form of type system in which types are communication steps and ...
Resource Fairness and Composability of Cryptographic Protocols

We introduce the notion of resource-fair protocols. Informally, this property states that if one party learns the output of the protocol, then so can all other parties, as long as they expend roughly the same amount of resources. As opposed to ...

Reviews

Reviewer: Anthony Donald Vanker

Abadi provides a status report on the ongoing research into achieving secrecy properties (including integrity, confidentiality, availability, anonymity, and non-repudiation) in security protocols. He presents principles and rules based on traditional concepts of classification and information flow, with extensions to handle concurrent processes that use shared-key (secret key) cryptography. The principles are applied to security protocol analysis and design. The rules are typing rules for a basic concurrent language, the spi calculus. The spi calculus, created by the author as an extension to the pi calculus, includes shared-key cryptographic properties. The types are public, secret, and any. These rules are used to determine whether the desired properties have been realized. The author shows that if a security protocol typechecks, it does not leak its secret inputs.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 46, Issue 5

Sept. 1999

210 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/324133

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1999

Published in JACM Volume 46, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

202
Total Citations
View Citations
1,952
Total Downloads

Downloads (Last 12 months)98
Downloads (Last 6 weeks)20

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nelson BPagnin EAskarov A(2024)Metadata Privacy Beyond Tunneling for Instant Messaging2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP60621.2024.00044(697-723)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSP60621.2024.00044
Linvill KKaki GWustrow E(2023)Verifying Indistinguishability of Privacy-Preserving ProtocolsProceedings of the ACM on Programming Languages10.1145/36228497:OOPSLA2(1442-1469)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622849
Patrignani MBlackshear S(2023)Robust Safety for Move2023 IEEE 36th Computer Security Foundations Symposium (CSF)10.1109/CSF57540.2023.00045(308-323)Online publication date: Jul-2023
https://doi.org/10.1109/CSF57540.2023.00045
Meadows C(2023)Type Checking and SecurityEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-642-27739-9_867-2(1-3)Online publication date: 27-Oct-2023
https://doi.org/10.1007/978-3-642-27739-9_867-2
Mayrhofer RSigg S(2021)Adversary Models for Mobile Device AuthenticationACM Computing Surveys10.1145/347760154:9(1-35)Online publication date: 8-Oct-2021
https://dl.acm.org/doi/10.1145/3477601
Bulathwela SPérez-Ortiz MMehrotra ROrlic Dde la Higuera CShawe-Taylor JYilmaz E(2021)Report on the WSDM 2020 workshop on state-based user modelling (SUM'20)ACM SIGIR Forum10.1145/3451964.345196954:1(1-11)Online publication date: 19-Feb-2021
https://dl.acm.org/doi/10.1145/3451964.3451969
Ma SHuai J(2021)Approximate computation for big data analyticsACM SIGWEB Newsletter10.1145/3447879.34478832021:Winter(1-8)Online publication date: 19-Feb-2021
https://dl.acm.org/doi/10.1145/3447879.3447883
Patrignani MGarg D(2021)Robustly Safe Compilation, an Efficient Form of Secure CompilationACM Transactions on Programming Languages and Systems10.1145/343680943:1(1-41)Online publication date: 9-Feb-2021
https://dl.acm.org/doi/10.1145/3436809
Sanan DZhao YLin SYang L(2021)CSimACM Transactions on Programming Languages and Systems10.1145/343680843:1(1-46)Online publication date: 9-Feb-2021
https://dl.acm.org/doi/10.1145/3436808
Busi MDegano PGalletta L(2021)Mechanical incrementalization of typing algorithmsScience of Computer Programming10.1016/j.scico.2021.102657208(102657)Online publication date: Aug-2021
https://doi.org/10.1016/j.scico.2021.102657
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Analyzing security protocols with secrecy types and logic programs

Security by typing

Resource Fairness and Composability of Cryptographic Protocols

Reviews

Access critical reviews of Computing literature here

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Analyzing security protocols with secrecy types and logic programs

Security by typing

Resource Fairness and Composability of Cryptographic Protocols

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations