Secure multiparty computation and secret sharing:
In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2015
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 TUM01 UER01 UPA01 Volltext |
| Zusammenfassung: | In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, while secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last 30 years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC. |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (x, 373 pages) |
| ISBN: | 9781107337756 |
| DOI: | 10.1017/CBO9781107337756 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043940204 | ||
| 003 | DE-604 | ||
| 005 | 20230711 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9781107337756 |c Online |9 978-1-107-33775-6 | ||
| 024 | 7 | |a 10.1017/CBO9781107337756 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781107337756 | ||
| 035 | |a (OCoLC)967599065 | ||
| 035 | |a (DE-599)BVBBV043940204 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-29 |a DE-92 |a DE-91 |a DE-739 | ||
| 082 | 0 | |a 005.8 |2 23 | |
| 084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
| 084 | |a DAT 465 |2 stub | ||
| 100 | 1 | |a Cramer, Ronald J. F. |d 1968- |e Verfasser |0 (DE-588)174107587 |4 aut | |
| 245 | 1 | 0 | |a Secure multiparty computation and secret sharing |c Ronald Cramer, Centrum Wiskunde & Informatica, Ivan Damgaard, Aarhus University, Jesper Buus Nielsen, Aarhus University |
| 246 | 1 | 3 | |a Secure Multiparty Computation & Secret Sharing |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2015 | |
| 300 | |a 1 online resource (x, 373 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, while secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last 30 years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC. | ||
| 650 | 4 | |a Computer networks / Security measures | |
| 650 | 4 | |a Computer security | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Information theory | |
| 650 | 0 | 7 | |a Computersicherheit |0 (DE-588)4274324-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computersicherheit |0 (DE-588)4274324-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Damgård, Ivan B. |e Sonstige |0 (DE-588)112774180 |4 oth | |
| 700 | 1 | |a Nielsen, Jesper Buus |e Sonstige |0 (DE-588)1078045542 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-107-04305-3 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781107337756 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029349174 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107337756 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107337756 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107337756 |l TUM01 |p ZDB-20-CBO |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107337756 |l UER01 |p ZDB-20-CBO |q UER_PDA_CBO_Kauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107337756 |l UPA01 |p ZDB-20-CBO |q UPA_PDA_CBO_Kauf2019 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176880416325632 |
|---|---|
| any_adam_object | |
| author | Cramer, Ronald J. F. 1968- |
| author_GND | (DE-588)174107587 (DE-588)112774180 (DE-588)1078045542 |
| author_facet | Cramer, Ronald J. F. 1968- |
| author_role | aut |
| author_sort | Cramer, Ronald J. F. 1968- |
| author_variant | r j f c rjf rjfc |
| building | Verbundindex |
| bvnumber | BV043940204 |
| classification_rvk | ST 276 |
| classification_tum | DAT 465 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781107337756 (OCoLC)967599065 (DE-599)BVBBV043940204 |
| dewey-full | 005.8 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.8 |
| dewey-search | 005.8 |
| dewey-sort | 15.8 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9781107337756 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03520nmm a2200565zc 4500</leader><controlfield tag="001">BV043940204</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230711 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107337756</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-107-33775-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781107337756</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781107337756</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967599065</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940204</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.8</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 276</subfield><subfield code="0">(DE-625)143642:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 465</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cramer, Ronald J. F.</subfield><subfield code="d">1968-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)174107587</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Secure multiparty computation and secret sharing</subfield><subfield code="c">Ronald Cramer, Centrum Wiskunde & Informatica, Ivan Damgaard, Aarhus University, Jesper Buus Nielsen, Aarhus University</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Secure Multiparty Computation & Secret Sharing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 373 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, while secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last 30 years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks / Security measures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer security</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Damgård, Ivan B.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)112774180</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nielsen, Jesper Buus</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1078045542</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-107-04305-3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781107337756</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349174</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107337756</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107337756</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107337756</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107337756</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UER_PDA_CBO_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107337756</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UPA_PDA_CBO_Kauf2019</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043940204 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:13Z |
| institution | BVB |
| isbn | 9781107337756 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349174 |
| oclc_num | 967599065 |
| open_access_boolean | |
| owner | DE-12 DE-29 DE-92 DE-91 DE-BY-TUM DE-739 |
| owner_facet | DE-12 DE-29 DE-92 DE-91 DE-BY-TUM DE-739 |
| physical | 1 online resource (x, 373 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Einzelkauf ZDB-20-CBO UER_PDA_CBO_Kauf ZDB-20-CBO UPA_PDA_CBO_Kauf2019 |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Cramer, Ronald J. F. 1968- Verfasser (DE-588)174107587 aut Secure multiparty computation and secret sharing Ronald Cramer, Centrum Wiskunde & Informatica, Ivan Damgaard, Aarhus University, Jesper Buus Nielsen, Aarhus University Secure Multiparty Computation & Secret Sharing Cambridge Cambridge University Press 2015 1 online resource (x, 373 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, while secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last 30 years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC. Computer networks / Security measures Computer security Computer network protocols Information theory Computersicherheit (DE-588)4274324-2 gnd rswk-swf Computersicherheit (DE-588)4274324-2 s 1\p DE-604 Damgård, Ivan B. Sonstige (DE-588)112774180 oth Nielsen, Jesper Buus Sonstige (DE-588)1078045542 oth Erscheint auch als Druck-Ausgabe 978-1-107-04305-3 https://doi.org/10.1017/CBO9781107337756 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Cramer, Ronald J. F. 1968- Secure multiparty computation and secret sharing Computer networks / Security measures Computer security Computer network protocols Information theory Computersicherheit (DE-588)4274324-2 gnd |
| subject_GND | (DE-588)4274324-2 |
| title | Secure multiparty computation and secret sharing |
| title_alt | Secure Multiparty Computation & Secret Sharing |
| title_auth | Secure multiparty computation and secret sharing |
| title_exact_search | Secure multiparty computation and secret sharing |
| title_full | Secure multiparty computation and secret sharing Ronald Cramer, Centrum Wiskunde & Informatica, Ivan Damgaard, Aarhus University, Jesper Buus Nielsen, Aarhus University |
| title_fullStr | Secure multiparty computation and secret sharing Ronald Cramer, Centrum Wiskunde & Informatica, Ivan Damgaard, Aarhus University, Jesper Buus Nielsen, Aarhus University |
| title_full_unstemmed | Secure multiparty computation and secret sharing Ronald Cramer, Centrum Wiskunde & Informatica, Ivan Damgaard, Aarhus University, Jesper Buus Nielsen, Aarhus University |
| title_short | Secure multiparty computation and secret sharing |
| title_sort | secure multiparty computation and secret sharing |
| topic | Computer networks / Security measures Computer security Computer network protocols Information theory Computersicherheit (DE-588)4274324-2 gnd |
| topic_facet | Computer networks / Security measures Computer security Computer network protocols Information theory Computersicherheit |
| url | https://doi.org/10.1017/CBO9781107337756 |
| work_keys_str_mv | AT cramerronaldjf securemultipartycomputationandsecretsharing AT damgardivanb securemultipartycomputationandsecretsharing AT nielsenjesperbuus securemultipartycomputationandsecretsharing AT cramerronaldjf securemultipartycomputationsecretsharing AT damgardivanb securemultipartycomputationsecretsharing AT nielsenjesperbuus securemultipartycomputationsecretsharing |