Author of the publication

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)

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.

No persons found for author name Nof, Ariel
add a person with the name Nof, Ariel
 

Other publications of authors with the same name

Fast Garbling of Circuits Under Standard Assumptions., , , and . J. Cryptology, 31 (3): 798-844 (2018)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 Secure Three-Party Computation for Malicious Adversaries and an Honest Majority., , , and . IACR Cryptology ePrint Archive, (2016)Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs., , , and . CCS, page 869-886. ACM, (2019)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)Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody., , and . IACR Cryptology ePrint Archive, (2018)Fast Large-Scale Honest-Majority MPC for Malicious Adversaries., , , , , , and . CRYPTO (3), volume 10993 of Lecture Notes in Computer Science, page 34-64. Springer, (2018)DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation., , , , , and . ACM Conference on Computer and Communications Security, page 1841-1843. ACM, (2016)Fast Garbling of Circuits Under Standard Assumptions., , , and . ACM Conference on Computer and Communications Security, page 567-578. ACM, (2015)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)