Zobrazeno 1 - 10 of 80 pro vyhledávání: '"Nuttapong Attrapadung"'
1
Akademický článek
MOBIUS: Model-Oblivious Binarized Neural Networks
Autor: Hiromasa Kitai, Jason Paul Cruz, Naoto Yanai, Naohisa Nishida, Tatsumi Oba, Yuji Unagami, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka
Publikováno v: IEEE Access, Vol 7, Pp 139021-139034 (2019)
A privacy-preserving framework in which a computational resource provider receives encrypted data from a client and returns prediction results without decrypting the data, i.e., oblivious neural network or encrypted prediction, has been studied in ma
Externí odkaz: https://doaj.org/article/0b6f5f7b90144a00be9f62d9ecbb6ace
Zobrazit plný text záznamu
2
Maliciously circuit-private multi-key FHE and MPC based on LWE
Autor: Nuttapong Attrapadung, Goichiro Hanaoka, Ryo Hiromasa, Takahiro Matsuda, Jacob C. N. Schuldt
Publikováno v: Designs, Codes and Cryptography. 91:1645-1684
In this paper, we construct multi-key homomorphic and fully homomorphic encryption (resp. MKHE and MKFHE) schemes with malicious circuit privacy. Our schemes are based on learning with errors (LWE) besides appropriate circular security assumptions. I
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::488fda0e77253a6532cac0d9a417b39e
https://doi.org/10.1007/s10623-022-01160-x
Zobrazit plný text záznamu
5
Memory and Round-Efficient MPC Primitives in the Pre-Processing Model from Unit Vectorization
Autor: Nuttapong Attrapadung, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt, Kazunari Tozawa
Publikováno v: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security.
In this paper, we propose memory- and round-efficient protocols for securely evaluating arithmetic primitives. We focus on secure two-party computation over the ring ℤ2k that achieves security against semi-honest adversaries and works in the pre-pr
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5efbe394cd3073d9b759d2524ad3df9
https://doi.org/10.1145/3488932.3517407
Zobrazit plný text záznamu
8
Oblivious Linear Group Actions and Applications
Autor: Hiraku Morita, Goichiro Hanaoaka, Nuttapong Attrapadung, Kazunari Tozawa, Takahiro Matsuda, Tadanori Teruya, Kazuma Ohara, Jacob C. N. Schuldt
Publikováno v: CCS
In this paper we propose efficient two-party protocols for obliviously applying a (possibly random) linear group action to a data set. Our protocols capture various applications such as oblivious shuffles, circular shifts, matrix multiplications, to
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd209da136fac1c89376a16da4b704d8
https://doi.org/10.1145/3460120.3484584
Zobrazit plný text záznamu
9
A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions
Autor: Jacob C. N. Schuldt, Goichiro Hanaoka, Shinsaku Kiyomoto, Nuttapong Attrapadung, Tomoaki Mimoto
Publikováno v: PST
Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration h
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63228d4fb21aa77c2d95758cb02e00db
https://doi.org/10.1587/transfun.e102.a.1048
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje