Reo Eriguchi
Orcid: 0000-0002-0019-6934
According to our database1,
Reo Eriguchi
authored at least 19 papers
between 2019 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search.
IACR Cryptol. ePrint Arch., 2024
Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness.
IACR Cryptol. ePrint Arch., 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
2023
Des. Codes Cryptogr., December, 2023
Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures.
Des. Codes Cryptogr., May, 2023
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., March, 2023
Efficient Noise Generation Protocols for Differentially Private Multiparty Computation.
IEEE Trans. Dependable Secur. Comput., 2023
IACR Cryptol. ePrint Arch., 2023
Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity.
IACR Cryptol. ePrint Arch., 2023
2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
2021
Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-degree Polynomials.
IACR Cryptol. ePrint Arch., 2021
Efficient Noise Generation to Achieve Differential Privacy with Applications to Secure Multiparty Computation.
Proceedings of the Financial Cryptography and Data Security, 2021
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
2020
Strong security of linear ramp secret sharing schemes with general access structures.
Inf. Process. Lett., 2020
A Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020
2019
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019