short-paper

Domain-polymorphic language for privacy-preserving applications

Authors:

Peeter Laud, and

Jaak RandmetsAuthors Info & Claims

PETShop '13: Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies

November 2013

Pages 23 - 26

https://doi.org/10.1145/2517872.2517875

Published: 04 November 2013 Publication History

Abstract

We present SecreC, a programming language for specifying privacy-preserving applications using a mix of techniques for secure multiparty computation. Building on the concept of protection domain as an abstraction of resources used to ensure the privacy of data, the SecreC language allows the specification of protection domains for different pieces of data, and the specification of the computation in domain-polymorphic manner. We have implemented the compiler for the language, integrated it with the existing SMC framework Sharemind, and are currently using it for new privacy-preserving applications.

References

[1]

D. Bogdanov, P. Laud, and J. Randmets. Domain-Polymorphic Programming of Privacy-Preserving Applications. Cryptology ePrint Archive, Report 2013/371, 2013. http://eprint.iacr.org/.

[2]

D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A Framework for Fast Privacy-Preserving Computations. In S. Jajodia and J. Lopez, editors, Proceedings of the 13th European Symposium on Research in Computer Security, ESORICS'08, volume 5283 of Lecture Notes in Computer Science, pages 192--206. Springer, 2008.

Digital Library

[3]

M. Burkhart, M. Strasser, D. Many, and X. A. Dimitropoulos. Sepia: Privacy-preserving aggregation of multi-domain network events and statistics. In USENIX Security Symposium, pages 223--240. USENIX Association, 2010.

Digital Library

[4]

I. Damgård and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In D. Boneh, editor, CRYPTO, volume 2729 of Lecture Notes in Computer Science, pages 247--264. Springer, 2003.

[5]

M. Geisler. Cryptographic Protocols: Theory and Implementation. PhD thesis, Aarhus University, February 2010.

[6]

C. Gentry. Fully homomorphic encryption using ideal lattices. In M. Mitzenmacher, editor, STOC, pages 169--178. ACM, 2009.

Digital Library

[7]

W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. TASTY: tool for automating secure two-party computations. In E. Al-Shaer, A. D. Keromytis, and V. Shmatikov, editors, Proceedings of the 17th ACM Conference on Computer and Communications Security. CCS'10, pages 451--462. ACM, 2010.

Digital Library

[8]

Y. Ishai and A. Paskin. Evaluating Branching Programs on Encrypted Data. In S. P. Vadhan, editor, TCC, volume 4392 of Lecture Notes in Computer Science, pages 575--594. Springer, 2007.

Digital Library

[9]

F. Kerschbaum, T. Schneider, and A. Schröpfer. Automatic Protocol Selection in Secure Two-Party Computations. In 20th Network and Distributed System Security Symposium (NDSS), 2013.

[10]

B. Kreuter, abhi shelat, and C.-H. Shen. Billion-gate secure computation with malicious adversaries. In Proceedings of the 21st USENIX conference on Security, 2012.

Digital Library

[11]

L. Malka. Vmcrypt: modular software architecture for scalable secure computation. In Y. Chen, G. Danezis, and V. Shmatikov, editors, ACM Conference on Computer and Communications Security, pages 715--724. ACM, 2011.

Digital Library

[12]

A. C. Myers. JFlow: Practical Mostly-Static Information Flow Control. In A. W. Appel and A. Aiken, editors, POPL, pages 228--241. ACM, 1999.

Digital Library

[13]

A. Shamir. How to share a secret. Commun. ACM, 22(11):612--613, 1979.

Digital Library

[14]

A. C.-C. Yao. Protocols for Secure Computations (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science. FOCS’82, pages 160--164. IEEE, 1982.

Digital Library

[15]

B. Zhang. Generic Constant-Round Oblivious Sorting Algorithm for MPC. In X. Boyen and X. Chen, editors, ProvSec, volume 6980 of Lecture Notes in Computer Science, pages 240--256. Springer, 2011.

Digital Library

Cited By

Belorgey MCarpov SDeforth KJetchev DSae-Tang AVuille MGama NKatz JLeontiadis IMohammadi M(2023)Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean ArithmeticJournal of Cryptology10.1007/s00145-023-09464-436:3Online publication date: 11-Jul-2023
https://doi.org/10.1007/s00145-023-09464-4
Willemson J(2020)How Not to Use a Privacy-Preserving Computation Platform: Case Study of a Voting ApplicationComputer Security10.1007/978-3-030-42048-2_8(111-121)Online publication date: 22-Feb-2020
https://doi.org/10.1007/978-3-030-42048-2_8
Chandran NGupta DRastogi ASharma RTripathi S(2019)EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning2019 IEEE European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP.2019.00043(496-511)Online publication date: Jun-2019
https://doi.org/10.1109/EuroSP.2019.00043
Show More Cited By

Index Terms

Domain-polymorphic language for privacy-preserving applications
1. Security and privacy
  1. Cryptography
  2. Systems security
    1. Operating systems security
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Polymorphism

Recommendations

Domain-Polymorphic Programming of Privacy-Preserving Applications
PLAS'14: Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security

Secure Multi-party Computation (SMC) is seen as one of the main enablers for secure outsourcing of computation. Currently, there are many different SMC techniques (garbled circuits, secret sharing, homomorphic encryption, etc.) and none of them is ...
Read More
Secure Multi-party Protocols for Privacy Preserving Data Mining
WASA '08: Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications

People are more and more concerned with privacy protection while performing data mining. ID3 is a very popular decision tree building method in data mining. Entropy and Gini index are two different criteria used in ID3. While there is quite some work in ...
Read More
A Decentralized Information Marketplace Preserving Input and Output Privacy
DEC '23: Proceedings of the Second ACM Data Economy Workshop

Data-driven applications are engines of economic growth and essential for progress in many domains. The data involved is often of a personal nature. We propose a decentralized information marketplace where data held by data providers, such as ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PETShop '13: Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies

November 2013

36 pages

ISBN:9781450324892

DOI:10.1145/2517872

Program Chairs:
Martin Franz
Deutsche Bank, Germany
,
Andreas Holzer
Vienna University of Technology, Austria
,
Rupak Majumdar
MPI SWS Kaiserslautern, Germany
,
Bryan Parno
Microsoft Research, USA
,
Helmut Veith
Vienna University of Technology, Austria

Copyright © 2013 ACM.

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 the author(s) 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

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CCS'13

Sponsor:

SIGSAC

CCS'13: 2013 ACM SIGSAC Conference on Computer and Communications Security

November 4, 2013

Berlin, Germany

Acceptance Rates

PETShop '13 Paper Acceptance Rate 7 of 8 submissions, 88%;

Overall Acceptance Rate 7 of 8 submissions, 88%

Upcoming Conference

CCS '24

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 14 - 18, 2024

Salt Lake City , UT , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
97
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Belorgey MCarpov SDeforth KJetchev DSae-Tang AVuille MGama NKatz JLeontiadis IMohammadi M(2023)Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean ArithmeticJournal of Cryptology10.1007/s00145-023-09464-436:3Online publication date: 11-Jul-2023
https://doi.org/10.1007/s00145-023-09464-4
Willemson J(2020)How Not to Use a Privacy-Preserving Computation Platform: Case Study of a Voting ApplicationComputer Security10.1007/978-3-030-42048-2_8(111-121)Online publication date: 22-Feb-2020
https://doi.org/10.1007/978-3-030-42048-2_8
Chandran NGupta DRastogi ASharma RTripathi S(2019)EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning2019 IEEE European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP.2019.00043(496-511)Online publication date: Jun-2019
https://doi.org/10.1109/EuroSP.2019.00043
Liu XYi X(2019)Privacy-Preserving Collaborative Medical Time Series Analysis Based on Dynamic Time WarpingComputer Security – ESORICS 201910.1007/978-3-030-29962-0_21(439-460)Online publication date: 15-Sep-2019
https://doi.org/10.1007/978-3-030-29962-0_21
Baldimtsi FPapadopoulos DPapadopoulos SScafuro ATriandopoulos N(2017)Server-Aided Secure Computation with Off-line PartiesComputer Security – ESORICS 201710.1007/978-3-319-66402-6_8(103-123)Online publication date: 12-Aug-2017
https://doi.org/10.1007/978-3-319-66402-6_8
Pullonen PSiim S(2015)Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point ComputationsFinancial Cryptography and Data Security10.1007/978-3-662-48051-9_13(172-183)Online publication date: 5-Sep-2015
https://doi.org/10.1007/978-3-662-48051-9_13
Bogdanov DLaur STalviste R(2014)A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party ComputationSecure IT Systems10.1007/978-3-319-11599-3_4(59-74)Online publication date: 2014
https://doi.org/10.1007/978-3-319-11599-3_4
Bogdanov DKamm LLaur SPruulmann-Vengerfeldt PTalviste RWillemson J(2014)Privacy-Preserving Statistical Data Analysis on Federated DatabasesPrivacy Technologies and Policy10.1007/978-3-319-06749-0_3(30-55)Online publication date: 2014
https://doi.org/10.1007/978-3-319-06749-0_3

View Options

Get Access

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents