skip to main content
10.1145/1132516.1132532acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Information-theoretically secure protocols and security under composition

Published: 21 May 2006 Publication History

Abstract

We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies security under concurrent composition. This question is motivated by the folklore that all known protocols that are secure in the information-theoretic setting are indeed secure under concurrent composition. We provide answers to this question for a number of different settings (i.e., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs). Our results enhance the understanding of what is necessary for obtaining security under composition, as well as providing tools (i.e., composition theorems) that can be used for proving the security of protocols under composition while considering only the standard stand-alone definitions of security.

References

[1]
D. Beaver. Multiparty Protocols Tolerating Half Faulty Processors. Multiparty Protocols Tolerating Half Faulty Processors. In CRYPTO'89, Springer-Verlag (LNCS 435), pages 560--572, 1990.]]
[2]
D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377--391, 1991.]]
[3]
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. In 20th STOC, pages 1--10, 1988.]]
[4]
R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143--202, 2000.]]
[5]
R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136--145, 2001.]]
[6]
D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In 20th STOC, pages 11--19, 1988.]]
[7]
R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient Multiparty Computations with Dishonest Minority. In EUROCRYPT'99, Springer-Verlag (LNCS 1592), pages 311--326, 1999.]]
[8]
R. Canetti and H. Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. In EUROCRYPT'02, Springer-Verlag (LNCS 2332), pages 337--351, 2002.]]
[9]
D. Dolev, C. Dwork, and M. Naor. Non-malleable Cryptography. SICOMP, 30(2):391--437, 2000.]]
[10]
Y. Dodis and S. Micali. Parallel Reducibility for Information-Theoretically Secure Computation. In CRYPTO'00, (LNCS 1880), pages 74--92, 2000.]]
[11]
C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-knowledge. JACM, 51(6):851--898, 2004.]]
[12]
Uri Feige. Alternative Models for Zero Knowledge Interactive Proofs. PhD thesis, 1990.]]
[13]
S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, Springer-Verlag (LNCS 537), pages 77--93, 1990.]]
[14]
O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In 19th STOC, pages 218--229, 1987.]]
[15]
Oded Goldreich. Foundations of Cryptography: Volume 2. Cambridge University Press, 2004.]]
[16]
Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683--692, 2003.]]
[17]
Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation. In 44st FOCS, pages 394--403, 2003.]]
[18]
Y. Lindell. Lower Bounds for Concurrent Self Composition. In 1st TCC, Springer-Verlag (LNCS 2951), pages 203--222, 2004.]]
[19]
S. Micali and P. Rogaway. Secure Computation. In CRYPTO'91, pages 392--404, 1991.]]
[20]
B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In 7th ACM CCS, pages 245--254, 2000.]]
[21]
T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In 21st STOC, pages 73--85, 1989.]]
[22]
A. C-C. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162--167, 1986.]]

Cited By

View all

Index Terms

  1. Information-theoretically secure protocols and security under composition

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
    May 2006
    786 pages
    ISBN:1595931341
    DOI:10.1145/1132516
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 May 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. information-theoretic security
    2. protocol composition
    3. secure computation
    4. theory of cryptography

    Qualifiers

    • Article

    Conference

    STOC06
    Sponsor:
    STOC06: Symposium on Theory of Computing
    May 21 - 23, 2006
    WA, Seattle, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)12
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Secure Multi-Party Linear Algebra with Perfect CorrectnessIACR Communications in Cryptology10.62056/avzojbkrzOnline publication date: 9-Apr-2024
    • (2024)PPTIF: Privacy-Preserving Transformer Inference Framework for Language TranslationIEEE Access10.1109/ACCESS.2024.338426812(48881-48897)Online publication date: 2024
    • (2024)Zero-Knowledge IOPs Approaching Witness LengthAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68403-6_4(105-137)Online publication date: 16-Aug-2024
    • (2024)Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSSAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_11(310-339)Online publication date: 29-Apr-2024
    • (2023)Arboretum: A Planner for Large-Scale Federated Analytics with Differential PrivacyProceedings of the 29th Symposium on Operating Systems Principles10.1145/3600006.3624566(451-465)Online publication date: 23-Oct-2023
    • (2023)Privformer: Privacy-preserving Transformer with MPC2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP57164.2023.00031(392-410)Online publication date: Jul-2023
    • (2023)On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal ResilienceJournal of Cryptology10.1007/s00145-023-09451-936:2Online publication date: 25-Mar-2023
    • (2023)CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From TimePublic-Key Cryptography – PKC 202310.1007/978-3-031-31368-4_16(439-470)Online publication date: 2-May-2023
    • (2023)Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected TimeAdvances in Cryptology – EUROCRYPT 202310.1007/978-3-031-30617-4_9(251-281)Online publication date: 15-Apr-2023
    • (2023)Random Sources in Private ComputationAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_15(443-473)Online publication date: 25-Jan-2023
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media