Efficient MPC with a Mixed Adversary (English)
Free access
- New search for: Hirt, Martin
- New search for: Mularczyk, Marta
- New search for: Hirt, Martin
- New search for: Mularczyk, Marta
- New search for: Tauman Kalai, Yael
- New search for: Smith, Adam D.
- New search for: Wichs, Daniel
In:
LIPIcs, Volume 163, ITC 2020
: 1st Conference on Information-Theoretic Cryptography (ITC 2020)
;
163
;
3:1-3:23
;
2020
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Efficient MPC with a Mixed Adversary
-
Contributors:Hirt, Martin ( author ) / Mularczyk, Marta ( author ) / Tauman Kalai, Yael ( editor ) / Smith, Adam D. ( editor ) / Wichs, Daniel ( editor )
-
Published in:LIPIcs, Volume 163, ITC 2020 : 1st Conference on Information-Theoretic Cryptography (ITC 2020) ; 163 ; 3:1-3:23Leibniz International Proceedings in Informatics (LIPIcs) ; 163 ; 3:1-3:23
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2020-06-04
-
Size:23 pages , 618270 byte
-
Remarks:LIPIcs, Vol. 163, 1st Conference on Information-Theoretic Cryptography (ITC 2020), pages 3:1-3:23
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Separating Local & Shuffled Differential Privacy via HistogramsBalcer, Victor / Cheu, Albert et al. | 2020
- 2
-
d-Multiplicative Secret Sharing for Multipartite Adversary StructuresEriguchi, Reo / Kunihiro, Noboru et al. | 2020
- 3
-
Efficient MPC with a Mixed AdversaryHirt, Martin / Mularczyk, Marta et al. | 2020
- 4
-
Practical Relativistic Zero-Knowledge for NPCrépeau, Claude / Massenet, Arnaud Y. / Salvail, Louis / Stinchcombe, Lucas Shigeru / Yang, Nan et al. | 2020
- 5
-
Use Your Brain! Arithmetic 3PC for Any Modulus with Active SecurityEerikson, Hendrik / Keller, Marcel / Orlandi, Claudio / Pullonen, Pille / Puura, Joonas / Simkin, Mark et al. | 2020
- 6
-
Expander Graphs Are Non-Malleable CodesRasmussen, Peter Michael Reichstein / Sahai, Amit et al. | 2020
- 7
-
Leakage-Resilient Secret Sharing in Non-Compartmentalized ModelsLin, Fuchun / Cheraghchi, Mahdi / Guruswami, Venkatesan / Safavi-Naini, Reihaneh / Wang, Huaxiong et al. | 2020
- 8
-
Lower Bounds for Function Inversion with Quantum AdviceChung, Kai-Min / Liao, Tai-Ning / Qian, Luowen et al. | 2020
- 9
-
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key DeliveryNaor, Moni / Rotem, Lior / Segev, Gil et al. | 2020
- 10
-
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs PerspectiveSegev, Gil / Shahaf, Ido et al. | 2020
- 11
-
Oblivious Parallel Tight CompactionAsharov, Gilad / Komargodski, Ilan / Lin, Wei-Kai / Peserico, Enoch / Shi, Elaine et al. | 2020
- 12
-
On Polynomial Secret Sharing SchemesPaskin-Cherniavsky, Anat / Artiom, Radune et al. | 2020
- 13
-
One-One Constrained Pseudorandom FunctionsPeter, Naty / Tsabary, Rotem / Wee, Hoeteck et al. | 2020
- 14
-
The Power of Synergy in Differential Privacy: Combining a Small Curator with Local RandomizersBeimel, Amos / Korolova, Aleksandra / Nissim, Kobbi / Sheffet, Or / Stemmer, Uri et al. | 2020
- 15
-
Pure Differentially Private Summation from Anonymous MessagesGhazi, Badih / Golowich, Noah / Kumar, Ravi / Manurangsi, Pasin / Pagh, Rasmus / Velingker, Ameya et al. | 2020
- 16
-
On Locally Decodable Codes in Resource Bounded ChannelsBlocki, Jeremiah / Kulkarni, Shubhang / Zhou, Samson et al. | 2020