skip to main content
10.1145/1455770.1455832acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Constructions of truly practical secure protocols using standardsmartcards

Published: 27 October 2008 Publication History

Abstract

In this paper we show that using standard smartcards it is possible to construct truly practical secure protocols for a variety of tasks. Our protocols achieve full simulation-based security in the presence of malicious adversaries, and can be run on very large inputs. We present protocols for secure set intersection, oblivious database search and more. We have also implemented our set intersection protocol in order to show that it is truly practical: on sets of size 30,000 elements takes 20 seconds for one party and 30 minutes for the other (where the latter can be parallelized to further reduce the time). This demonstrates that in settings where physical smartcards can be sent between parties (as in the case of private data mining tasks between security and governmental agencies), it is possible to use secure protocols with proven simulation-based security.

References

[1]
. Aggarwal, N. Mishra and B. Pinkas. Secure Computation of the K'th-ranked Element. In EUROCRYPT 2004, Springer-Verlag (LNCS 3027), pages 40--55, 2004.
[2]
. Aumann and Y. Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In 4th TCC, Springer-Verlag (LNCS 4392), pages 137--156, 2007.
[3]
. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377--391, 1991.
[4]
M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theoremsfor Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1--10, 1988.
[5]
. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143--202, 2000.
[6]
R. Canetti, Y. Ishai, R. Kumar, M.K. Reiter, R. Rubinfeld and R. Wright. Selective Private Function Evaluation with Applications to Private Statistics. In 20th PODC, pages 293--304, 2001.
[7]
. Chaum, C. Crépeau and I. Damgard. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11--19, 1988.
[8]
. Chor, N. Gilboa, and M. Naor. Private Information Retrieval by Keywords. Technical Report TR-CS0917, Department of Computer Science, Technion, 1997.
[9]
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private Information Retrieval. Journal of the ACM, 45(6):965--981, 1998.
[10]
.J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. In TCC 2005, Springer-Verlag (LNCS 3378), pages 303--324, 2005.
[11]
M.J. Freedman, K. Nissim and B. Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004, Springer-Verlag (LNCS 3027), pages 1--19, 2004.
[12]
O. Goldreich. Foundations of Cryptography: Vol. 1 -- Basic Tools. Cambridge University Press, 2001.
[13]
O. Goldreich. Foundations of Cryptography: Volume 2 -- Basic Applications. Cambridge University Press, 2004.
[14]
. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game -- A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218--229, 1987.
[15]
S. Goldwasser and L. Levin. Fair Computation of General Functionsin Presence of Immoral Majority. In CRYPTO'90, Springer-Verlag (LNCS 537), pages 77--93, 1990.
[16]
C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In 5th TCC, Springer-Verlag (LNCS 4948), pages 155--175, 2008.
[17]
L. Kissner and D.X. Song. Privacy-Preserving Set Operations.In CRYPTO 2005, Springer-Verlag (LNCS 3621), pages 241--257, 2005.
[18]
E. Kushilevitz, Y. Lindell and T. Rabin. Information-Theoretically Secure Protocols and Security Under Composition. In 38th STOC, pages 109--18, 2006.
[19]
. Lindell and B. Pinkas. Privacy Preserving Data Mining. Journal of Cryptology, 15(3):177--206, 2002. An extended abstract appeared in CRYPTO 2000.
[20]
S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, Springer-Verlag (LNCS 576),pages 392--404, 1991.
[21]
. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. In 31st STOC, pages 245--254, 1999.
[22]
. Witteman. Advances in Smartcard Security. Information Security Bulletin, July 2002, pages 11--22, 2002.
[23]
. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162--167, 1986.

Cited By

View all
  • (2024)Practical and Malicious Private Set Intersection with Improved EfficiencyTheoretical Computer Science10.1016/j.tcs.2024.114443(114443)Online publication date: Feb-2024
  • (2023)Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed LearningProceedings of the IEEE10.1109/JPROC.2023.3306773111:9(1097-1132)Online publication date: Sep-2023
  • (2022)Secure Multi-Party Private Set Intersection with Semi-Honest Nodes2022 10th Iran Workshop on Communication and Information Theory (IWCIT)10.1109/IWCIT57101.2022.10206548(1-6)Online publication date: 11-May-2022
  • Show More Cited By

Index Terms

  1. Constructions of truly practical secure protocols using standardsmartcards

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CCS '08: Proceedings of the 15th ACM conference on Computer and communications security
    October 2008
    590 pages
    ISBN:9781595938107
    DOI:10.1145/1455770
    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: 27 October 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. provable security
    2. secure computation
    3. smartcards

    Qualifiers

    • Research-article

    Conference

    CCS08
    Sponsor:

    Acceptance Rates

    CCS '08 Paper Acceptance Rate 51 of 280 submissions, 18%;
    Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

    Upcoming Conference

    CCS '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Practical and Malicious Private Set Intersection with Improved EfficiencyTheoretical Computer Science10.1016/j.tcs.2024.114443(114443)Online publication date: Feb-2024
    • (2023)Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed LearningProceedings of the IEEE10.1109/JPROC.2023.3306773111:9(1097-1132)Online publication date: Sep-2023
    • (2022)Secure Multi-Party Private Set Intersection with Semi-Honest Nodes2022 10th Iran Workshop on Communication and Information Theory (IWCIT)10.1109/IWCIT57101.2022.10206548(1-6)Online publication date: 11-May-2022
    • (2022)One-Time Programs from Commodity HardwareTheory of Cryptography10.1007/978-3-031-22368-6_5(121-150)Online publication date: 7-Nov-2022
    • (2022)Unclonable Polymers and Their Cryptographic ApplicationsAdvances in Cryptology – EUROCRYPT 202210.1007/978-3-031-06944-4_26(759-789)Online publication date: 30-May-2022
    • (2020)Multi-party Private Set Intersection in Vertical Federated Learning2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)10.1109/TrustCom50675.2020.00098(707-714)Online publication date: Dec-2020
    • (2019)Secure and Private Function Evaluation with Intel SGXProceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop10.1145/3338466.3358919(165-181)Online publication date: 11-Nov-2019
    • (2019)Verifiable top-k searchable encryption for cloud dataSādhanā10.1007/s12046-019-1227-545:1Online publication date: 20-Dec-2019
    • (2019)(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless TokensJournal of Cryptology10.1007/s00145-018-9288-x32:2(459-497)Online publication date: 1-Apr-2019
    • (2019)Non-interactive Zero Knowledge Proofs in the Random Oracle ModelCodes, Cryptology and Information Security10.1007/978-3-030-16458-4_9(118-141)Online publication date: 28-Mar-2019
    • 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