Author of the publication

Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier.

, , , , , , , , and . IEEE Symposium on Security and Privacy, page 843-862. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority., , and . CCS, page 653-666. ACM, (2022)Secure Statistical Analysis on Multiple Datasets: Join and Group-By., , , , , and . CCS, page 3298-3312. ACM, (2023)Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators., , , , and . IACR Cryptol. ePrint Arch., (2021)High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority., , , and . IACR Cryptology ePrint Archive, (2016)High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority., , , and . EUROCRYPT (2), volume 10211 of Lecture Notes in Computer Science, page 225-255. (2017)High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority., , , , and . ACM Conference on Computer and Communications Security, page 805-817. ACM, (2016)Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs., , , and . ACM Conference on Computer and Communications Security, page 869-886. ACM, (2019)Fast Garbling of Circuits Under Standard Assumptions., , , and . J. Cryptol., 31 (3): 798-844 (2018)Secure Statistical Analysis on Multiple Datasets: Join and Group-By., , , , , , and . IACR Cryptol. ePrint Arch., (2024)Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators., , , , and . SP, page 2554-2572. IEEE, (2022)