Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer (Englisch)
- Neue Suche nach: Patra, Arpita
- Neue Suche nach: Srinivasan, Akshayaram
- Neue Suche nach: Patra, Arpita
- Neue Suche nach: Srinivasan, Akshayaram
In:
Advances in cryptology - CRYPTO 2021 ; Part 2
; 185-213
;
2021
-
ISBN:
- Aufsatz (Konferenz) / Print
-
Titel:Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
-
Beteiligte:Patra, Arpita ( Autor:in ) / Srinivasan, Akshayaram ( Autor:in )
-
Kongress:CRYPTO ; 41. ; 2021 ; Online
-
Erschienen in:
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Cham
-
Erscheinungsdatum:2021
-
ISBN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 54.38
- Weitere Informationen zu Basisklassifikation
-
Schlagwörter:
-
Klassifikation:
BKL: 54.38 Computersicherheit -
Datenquelle:
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 3
-
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader ElectionChung, Kai-Min / Chan, T.-H. Hubert / Wen, Ting / Shi, Elaine et al. | 2021
- 33
-
Computational Hardness of Optimal Fair Computation: Beyond MinicryptMaji, Hemanta K. / Wang, Mingyuan et al. | 2021
- 64
-
YOSO: You Only Speak Once: Secure MPC with Stateless Ephemeral RolesGentry, Craig / Halevi, Shai / Krawczyk, Hugo / Magri, Bernardo / Nielsen, Jesper Buus / Rabin, Tal / Yakoubov, Sophia et al. | 2021
- 94
-
Fluid MPC: Secure Multiparty Computation with Dynamic ParticipantsChoudhuri, Arka Rai / Goel, Aarushi / Green, Matthew / Jain, Abhishek / Kaptchuk, Gabriel et al. | 2021
- 124
-
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentrationAgrawal, Shweta / Ishai, Yuval / Kushilevitz, Eyal / Narayanan, Varun / Prabhakaran, Manoj / Prabhakaran, Vinod / Rosen, Alon et al. | 2021
- 155
-
Broadcast-Optimal Two Round MPC with an Honest MajorityDamgård, Ivan / Magri, Bernardo / Ravi, Divya / Siniscalchi, Luisa / Yakoubov, Sophia et al. | 2021
- 185
-
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious TransferPatra, Arpita / Srinivasan, Akshayaram et al. | 2021
- 214
-
On the Round Complexity of Black-Box Secure MPCIshai, Yuval / Khurana, Dakshita / Sahai, Amit / Srinivasan, Akshayaram et al. | 2021
- 244
-
ATLAS: Efficient and Scalable MPC in the Honest Majority SettingGoyal, Vipul / Li, Hanjun / Ostrovsky, Rafail / Polychroniadou, Antigoni / Song, Yifan et al. | 2021
- 275
-
Unconditional Communication-Efficient MPC via Hall’s Marriage TheoremGoyal, Vipul / Polychroniadou, Antigoni / Song, Yifan et al. | 2021
- 305
-
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and ExtensionsEriguchi, Reo / Ohara, Kazuma / Yamada, Shota / Nuida, Koji et al. | 2021
- 335
-
Efficient Information-Theoretic Multi-party Computation over Non-commutative RingsEscudero, Daniel / Soria-Vazquez, Eduardo et al. | 2021
- 365
-
Pushing the Limits of Valiant’s Universal Circuits: Simpler, Tighter and More CompactLiu, Hanlin / Yu, Yu / Zhao, Shuoyao / Zhang, Jiang / Liu, Wenling / Hu, Zhenkai et al. | 2021
- 395
-
Oblivious Key-Value Stores and Amplification for Private Set IntersectionGarimella, Gayathri / Pinkas, Benny / Rosulek, Mike / Trieu, Ni / Yanai, Avishay et al. | 2021
- 426
-
MHz2k: MPC from HE over Z2k with New Packing, Simpler Reshare, and Better ZKPCheon, Jung Hee / Kim, Dongwoo / Lee, Keewoo et al. | 2021
- 457
-
Sublinear GMW-Style Compiler for MPC with PreprocessingBoyle, Elette / Gilboa, Niv / Ishai, Yuval / Nof, Ariel et al. | 2021
- 486
-
Limits on the Adaptive Security of Yao’s GarblingKamath, Chethan / Klein, Karen / Pietrzak, Krzysztof / Wichs, Daniel et al. | 2021
- 519
-
Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-Like Arguments over LatticesAlbrecht, Martin R. / Lai, Russell W. F. et al. | 2021
- 549
-
A Compressed Σ-Protocol Theory for LatticesAttema, Thomas / Cramer, Ronald / Kohl, Lisa et al. | 2021
- 580
-
A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKsKatsumata, Shuichi et al. | 2021
- 611
-
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential TransactionsLyubashevsky, Vadim / Nguyen, Ngoc Khanh / Seiler, Gregor et al. | 2021
- 641
-
Deniable Fully Homomorphic Encryption from Learning with ErrorsAgrawal, Shweta / Goldwasser, Shafi / Mossel, Saleet et al. | 2021
- 673
-
Counterexamples to New Circular Security Assumptions Underlying iOHopkins, Sam / Jain, Aayush / Lin, Huijia et al. | 2021
- 701
-
How to Meet Ternary LWE KeysMay, Alexander et al. | 2021
- 732
-
Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete PerformanceAlbrecht, Martin R. / Bai, Shi / Li, Jianwei / Rowell, Joe et al. | 2021
- 760
-
Towards Faster Polynomial-Time Lattice ReductionKirchner, Paul / Espitau, Thomas / Fouque, Pierre-Alain et al. | 2021
- 791
-
Lower Bounds on Lattice Sieving and Information Set DecodingKirshanova, Elena / Laarhoven, Thijs et al. | 2021