default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReo Eriguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Reo Eriguchi:
Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness. ITC 2024: 10:1-10:22- [c12]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida
:
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search. EUROCRYPT (5) 2024: 92-121 - [c11]Reo Eriguchi, Kazumasa Shinagawa, Takao Murakami:
Card-Based Cryptography Meets Differential Privacy. FUN 2024: 12:1-12:20 - [i10]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search. IACR Cryptol. ePrint Arch. 2024: 375 (2024) - [i9]Reo Eriguchi:
Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness. IACR Cryptol. ePrint Arch. 2024: 1152 (2024) - 2023
- [j5]Reo Eriguchi, Noboru Kunihiro, Koji Nuida:
Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures. Des. Codes Cryptogr. 91(5): 1751-1778 (2023) - [j4]Kazumasa Shinagawa, Reo Eriguchi, Shohei Satake, Koji Nuida:
Private simultaneous messages based on quadratic residues. Des. Codes Cryptogr. 91(12): 3915-3932 (2023) - [j3]Reo Eriguchi, Noboru Kunihiro, Koji Nuida:
Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures with Application to Symmetric PIR. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 263-271 (2023) - [j2]Reo Eriguchi, Atsunori Ichikawa, Noboru Kunihiro, Koji Nuida:
Efficient Noise Generation Protocols for Differentially Private Multiparty Computation. IEEE Trans. Dependable Secur. Comput. 20(6): 4486-4501 (2023) - [c10]Reo Eriguchi:
Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity. ASIACRYPT (1) 2023: 335-368 - [i8]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
New Generic Constructions of Error-Correcting PIR and Efficient Instantiations. IACR Cryptol. ePrint Arch. 2023: 210 (2023) - [i7]Reo Eriguchi:
Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity. IACR Cryptol. ePrint Arch. 2023: 662 (2023) - 2022
- [c9]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Multi-Server PIR with Full Error Detection and Limited Error Correction. ITC 2022: 1:1-1:20 - [c8]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
On the Optimal Communication Complexity of Error-Correcting Multi-server PIR. TCC (3) 2022: 60-88 - [i6]Kazumasa Shinagawa, Reo Eriguchi, Shohei Satake, Koji Nuida:
Private Simultaneous Messages Based on Quadratic Residues. CoRR abs/2209.01859 (2022) - [i5]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Multi-Server PIR with Full Error Detection and Limited Error Correction. IACR Cryptol. ePrint Arch. 2022: 500 (2022) - [i4]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
On the Optimal Communication Complexity of Error-Correcting Multi-Server PIR. IACR Cryptol. ePrint Arch. 2022: 1206 (2022) - [i3]Reo Eriguchi, Noboru Kunihiro, Koji Nuida:
Multiplicative and Verifiably Multiplicative Secret Sharing for Multipartite Adversary Structures. IACR Cryptol. ePrint Arch. 2022: 1390 (2022) - [i2]Reo Eriguchi, Atsunori Ichikawa, Noboru Kunihiro, Koji Nuida:
Efficient Noise Generation Protocols for Differentially Private Multiparty Computation. IACR Cryptol. ePrint Arch. 2022: 1391 (2022) - 2021
- [c7]Reo Eriguchi, Koji Nuida:
Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-Degree Polynomials. ASIACRYPT (2) 2021: 191-221 - [c6]Reo Eriguchi, Kazuma Ohara, Shota Yamada, Koji Nuida:
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions. CRYPTO (2) 2021: 305-334 - [c5]Reo Eriguchi, Atsunori Ichikawa, Noboru Kunihiro, Koji Nuida:
Efficient Noise Generation to Achieve Differential Privacy with Applications to Secure Multiparty Computation. Financial Cryptography (1) 2021: 271-290 - [i1]Reo Eriguchi, Koji Nuida:
Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-degree Polynomials. IACR Cryptol. ePrint Arch. 2021: 1395 (2021) - 2020
- [j1]Reo Eriguchi, Noboru Kunihiro:
Strong security of linear ramp secret sharing schemes with general access structures. Inf. Process. Lett. 164: 106018 (2020) - [c4]Reo Eriguchi, Noboru Kunihiro:
d-Multiplicative Secret Sharing for Multipartite Adversary Structures. ITC 2020: 2:1-2:16 - [c3]Reo Eriguchi, Noboru Kunihiro, Koji Nuida:
A Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures. ISITA 2020: 427-431
2010 – 2019
- 2019
- [c2]Reo Eriguchi, Noboru Kunihiro, Mitsugu Iwamoto:
Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes. ISIT 2019: 3047-3051 - [c1]Reo Eriguchi, Noboru Kunihiro:
Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes. ITW 2019: 1-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
