PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Ohara, Kazuma"

Author of the publication

copydeleteadd this publication to your clipboard
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 Ohara, Kazuma
add a person with the name Ohara, Kazuma
 

Other publications of authors with the same name

Generalizing the SPDZ Compiler For Other Protocols., , , , , , and . ACM Conference on Computer and Communications Security, page 880-895. ACM, (2018)How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ., , , , , and . ACM Conference on Computer and Communications Security, page 2198-2200. ACM, (2018)Privacy-preserving smart metering with verifiability for both billing and energy management., , , , and . AsiaPKC@AsiaCCS, page 23-32. ACM, (2014)Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum., , , and . AFRICACRYPT, volume 8469 of Lecture Notes in Computer Science, page 285-299. Springer, (2014)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)An energy-efficient dynamic-integrator-based ΔΣ modulator., , and . ICECS, page 467-470. IEEE, (2014)A group signature scheme with unbounded message-dependent opening., , , and . AsiaCCS, page 517-522. ACM, (2013)Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology., , , , , and . IACR Cryptology ePrint Archive, (2016)DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation., , , , , and . ACM Conference on Computer and Communications Security, page 1841-1843. ACM, (2016)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)