Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations
In a Secure Multiparty Computation (SMC), mutually distrusting parties use cryptographic techniques to cooperatively compute over their private data, in the process each party learns only explicitly revealed outputs. In this paper, we present Wysteria, a high-level programming language for writing S...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 670 |
---|---|
container_issue | |
container_start_page | 655 |
container_title | |
container_volume | |
creator | Rastogi, Aseem Hammer, Matthew A. Hicks, Michael |
description | In a Secure Multiparty Computation (SMC), mutually distrusting parties use cryptographic techniques to cooperatively compute over their private data, in the process each party learns only explicitly revealed outputs. In this paper, we present Wysteria, a high-level programming language for writing SMCs. As with past languages, like Fairplay, Wysteria compiles secure computations to circuits that are executed by an underlying engine. Unlike past work, Wysteria provides support for mixed-mode programs, which combine local, private computations with synchronous SMCs. Wysteria complements a standard feature set with built-in support for secret shares and with wire bundles, a new abstraction that supports generic n-party computations. We have formalized Wysteria, its refinement type system, and its operational semantics. We show that Wysteria programs have an easy-to-understand single-threaded interpretation and prove that this view corresponds to the actual multi-threaded semantics. We also prove type soundness, a property we show has security ramifications, namely that information about one party's data can only be revealed to another via (agreed upon) secure computations. We have implemented Wysteria, and used it to program a variety of interesting SMC protocols from the literature, as well as several new ones. We find that Wysteria's performance is competitive with prior approaches while making programming far easier, and more trustworthy. |
doi_str_mv | 10.1109/SP.2014.48 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee</sourceid><recordid>TN_cdi_ieee_primary_6956593</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6956593</ieee_id><sourcerecordid>6956593</sourcerecordid><originalsourceid>FETCH-LOGICAL-i211t-6559df6809adac3e5b6a525410599205993c999cdd972d7771936708904365703</originalsourceid><addsrcrecordid>eNotjE1Lw0AUAFdRsK1evHrZH2Dqe_uZ562UWoUEAyoey5rdhpUmKZsU7L9X0cvMZRjGrhHmiEB3L9VcAKq5yk_YFJUlUiY3dMomQlqdoQB7xiYIOWYGEC_YdBg-AQRIUhNWvR-HMaTo7vmCV6lvkmvb2DW8cF1zcE3g2z7xdeh-mvqWl_Er-KzsfeDlYTfGvUvjkS_7dn8Y3Rj7brhk51u3G8LVv2fs7WH1unzMiuf103JRZFEgjpnRmvzW5EDOu1oG_WGcFlohaCLxC1kTUe09WeGttUjSWMgJlDTagpyxm79vDCFs9im2Lh03hrTRJOU3gtJNCw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations</title><source>IEEE Electronic Library (IEL)</source><creator>Rastogi, Aseem ; Hammer, Matthew A. ; Hicks, Michael</creator><creatorcontrib>Rastogi, Aseem ; Hammer, Matthew A. ; Hicks, Michael</creatorcontrib><description>In a Secure Multiparty Computation (SMC), mutually distrusting parties use cryptographic techniques to cooperatively compute over their private data, in the process each party learns only explicitly revealed outputs. In this paper, we present Wysteria, a high-level programming language for writing SMCs. As with past languages, like Fairplay, Wysteria compiles secure computations to circuits that are executed by an underlying engine. Unlike past work, Wysteria provides support for mixed-mode programs, which combine local, private computations with synchronous SMCs. Wysteria complements a standard feature set with built-in support for secret shares and with wire bundles, a new abstraction that supports generic n-party computations. We have formalized Wysteria, its refinement type system, and its operational semantics. We show that Wysteria programs have an easy-to-understand single-threaded interpretation and prove that this view corresponds to the actual multi-threaded semantics. We also prove type soundness, a property we show has security ramifications, namely that information about one party's data can only be revealed to another via (agreed upon) secure computations. We have implemented Wysteria, and used it to program a variety of interesting SMC protocols from the literature, as well as several new ones. We find that Wysteria's performance is competitive with prior approaches while making programming far easier, and more trustworthy.</description><identifier>ISSN: 1081-6011</identifier><identifier>EISSN: 2375-1207</identifier><identifier>EISBN: 1479946869</identifier><identifier>EISBN: 9781479946860</identifier><identifier>DOI: 10.1109/SP.2014.48</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cryptography ; Dependent type system ; Educational institutions ; Functional language ; Protocols ; Secure multi-party computation ; Semantics ; Wires ; Writing</subject><ispartof>2014 IEEE Symposium on Security and Privacy, 2014, p.655-670</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6956593$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>309,310,776,780,785,786,792,23910,23911,25119,27904,54737</link.rule.ids></links><search><creatorcontrib>Rastogi, Aseem</creatorcontrib><creatorcontrib>Hammer, Matthew A.</creatorcontrib><creatorcontrib>Hicks, Michael</creatorcontrib><title>Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations</title><title>2014 IEEE Symposium on Security and Privacy</title><addtitle>SP</addtitle><description>In a Secure Multiparty Computation (SMC), mutually distrusting parties use cryptographic techniques to cooperatively compute over their private data, in the process each party learns only explicitly revealed outputs. In this paper, we present Wysteria, a high-level programming language for writing SMCs. As with past languages, like Fairplay, Wysteria compiles secure computations to circuits that are executed by an underlying engine. Unlike past work, Wysteria provides support for mixed-mode programs, which combine local, private computations with synchronous SMCs. Wysteria complements a standard feature set with built-in support for secret shares and with wire bundles, a new abstraction that supports generic n-party computations. We have formalized Wysteria, its refinement type system, and its operational semantics. We show that Wysteria programs have an easy-to-understand single-threaded interpretation and prove that this view corresponds to the actual multi-threaded semantics. We also prove type soundness, a property we show has security ramifications, namely that information about one party's data can only be revealed to another via (agreed upon) secure computations. We have implemented Wysteria, and used it to program a variety of interesting SMC protocols from the literature, as well as several new ones. We find that Wysteria's performance is competitive with prior approaches while making programming far easier, and more trustworthy.</description><subject>Cryptography</subject><subject>Dependent type system</subject><subject>Educational institutions</subject><subject>Functional language</subject><subject>Protocols</subject><subject>Secure multi-party computation</subject><subject>Semantics</subject><subject>Wires</subject><subject>Writing</subject><issn>1081-6011</issn><issn>2375-1207</issn><isbn>1479946869</isbn><isbn>9781479946860</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2014</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><recordid>eNotjE1Lw0AUAFdRsK1evHrZH2Dqe_uZ562UWoUEAyoey5rdhpUmKZsU7L9X0cvMZRjGrhHmiEB3L9VcAKq5yk_YFJUlUiY3dMomQlqdoQB7xiYIOWYGEC_YdBg-AQRIUhNWvR-HMaTo7vmCV6lvkmvb2DW8cF1zcE3g2z7xdeh-mvqWl_Er-KzsfeDlYTfGvUvjkS_7dn8Y3Rj7brhk51u3G8LVv2fs7WH1unzMiuf103JRZFEgjpnRmvzW5EDOu1oG_WGcFlohaCLxC1kTUe09WeGttUjSWMgJlDTagpyxm79vDCFs9im2Lh03hrTRJOU3gtJNCw</recordid><startdate>20141113</startdate><enddate>20141113</enddate><creator>Rastogi, Aseem</creator><creator>Hammer, Matthew A.</creator><creator>Hicks, Michael</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>ESBDL</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20141113</creationdate><title>Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations</title><author>Rastogi, Aseem ; Hammer, Matthew A. ; Hicks, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i211t-6559df6809adac3e5b6a525410599205993c999cdd972d7771936708904365703</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Cryptography</topic><topic>Dependent type system</topic><topic>Educational institutions</topic><topic>Functional language</topic><topic>Protocols</topic><topic>Secure multi-party computation</topic><topic>Semantics</topic><topic>Wires</topic><topic>Writing</topic><toplevel>online_resources</toplevel><creatorcontrib>Rastogi, Aseem</creatorcontrib><creatorcontrib>Hammer, Matthew A.</creatorcontrib><creatorcontrib>Hicks, Michael</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Open Access Journals</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rastogi, Aseem</au><au>Hammer, Matthew A.</au><au>Hicks, Michael</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations</atitle><btitle>2014 IEEE Symposium on Security and Privacy</btitle><stitle>SP</stitle><date>2014-11-13</date><risdate>2014</risdate><spage>655</spage><epage>670</epage><pages>655-670</pages><issn>1081-6011</issn><eissn>2375-1207</eissn><eisbn>1479946869</eisbn><eisbn>9781479946860</eisbn><coden>IEEPAD</coden><abstract>In a Secure Multiparty Computation (SMC), mutually distrusting parties use cryptographic techniques to cooperatively compute over their private data, in the process each party learns only explicitly revealed outputs. In this paper, we present Wysteria, a high-level programming language for writing SMCs. As with past languages, like Fairplay, Wysteria compiles secure computations to circuits that are executed by an underlying engine. Unlike past work, Wysteria provides support for mixed-mode programs, which combine local, private computations with synchronous SMCs. Wysteria complements a standard feature set with built-in support for secret shares and with wire bundles, a new abstraction that supports generic n-party computations. We have formalized Wysteria, its refinement type system, and its operational semantics. We show that Wysteria programs have an easy-to-understand single-threaded interpretation and prove that this view corresponds to the actual multi-threaded semantics. We also prove type soundness, a property we show has security ramifications, namely that information about one party's data can only be revealed to another via (agreed upon) secure computations. We have implemented Wysteria, and used it to program a variety of interesting SMC protocols from the literature, as well as several new ones. We find that Wysteria's performance is competitive with prior approaches while making programming far easier, and more trustworthy.</abstract><pub>IEEE</pub><doi>10.1109/SP.2014.48</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1081-6011 |
ispartof | 2014 IEEE Symposium on Security and Privacy, 2014, p.655-670 |
issn | 1081-6011 2375-1207 |
language | eng |
recordid | cdi_ieee_primary_6956593 |
source | IEEE Electronic Library (IEL) |
subjects | Cryptography Dependent type system Educational institutions Functional language Protocols Secure multi-party computation Semantics Wires Writing |
title | Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T14%3A03%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Wysteria:%20A%20Programming%20Language%20for%20Generic,%20Mixed-Mode%20Multiparty%20Computations&rft.btitle=2014%20IEEE%20Symposium%20on%20Security%20and%20Privacy&rft.au=Rastogi,%20Aseem&rft.date=2014-11-13&rft.spage=655&rft.epage=670&rft.pages=655-670&rft.issn=1081-6011&rft.eissn=2375-1207&rft.coden=IEEPAD&rft_id=info:doi/10.1109/SP.2014.48&rft_dat=%3Cieee%3E6956593%3C/ieee%3E%3Curl%3E%3C/url%3E&rft.eisbn=1479946869&rft.eisbn_list=9781479946860&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6956593&rfr_iscdi=true |