( en | de | ru )

 

Disambiguation of "Ohara, Kazuma"

Author of the publication

copydeleteadd this publication to your clipboard
Semantic Definition of Anonymity in Identity-Based Encryption and Its Relation to Indistinguishability-Based Definition.

, , , , and . ESORICS (2), volume 12309 of Lecture Notes in Computer Science, page 65-85. Springer, (2020)

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.

Mayumi Ohara

Kazuma Matoba

Mayumi Ohara

 

Other publications of authors with the same name

Efficient Dynamic Searchable Encryption with Forward Privacy under the Decent Leakage., , , and . CODASPY, page 312-323. ACM, (2022)Semantic Definition of Anonymity in Identity-Based Encryption and Its Relation to Indistinguishability-Based Definition., , , , and . ESORICS (2), volume 12309 of Lecture Notes in Computer Science, page 65-85. Springer, (2020)Memory and Round-Efficient MPC Primitives in the Pre-Processing Model from Unit Vectorization., , , , and . AsiaCCS, page 858-872. ACM, (2022)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)Generalizing the SPDZ Compiler For Other Protocols., , , , , , and . ACM Conference on Computer and Communications Security, page 880-895. ACM, (2018)Efficient Two-Party Exponentiation from Quotient Transfer., , , , and . ACNS, volume 13269 of Lecture Notes in Computer Science, page 643-662. Springer, (2022)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)Oblivious Linear Group Actions and Applications., , , , , , , and . CCS, page 630-650. ACM, (2021)