Masaya Yasuda - Concepedia

Author

Masaya Yasuda

Kyushu University ORCID

Also Known As

MASAYA YASUDA, Masaya Yasuda

104

Publications

626

Citations

H-Index

Concepts

All Affiliations

Kyushu University Fujitsu (Japan)Rikkyo University Saitama University

About

Masaya Yasuda is an author at Kyushu University specializing in engineering, computer science, and data security.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	7	7	234
2	Computer Science	7	7	234
3	Computer Engineering	2	2	54
4	Data Science	1	1	22
5	Combinatorial Optimization	1	1	15

Masaya Yasuda

Publications

234

Citations

H-Index

Page 1

	Year	Citations
Secure pattern matching using somewhat homomorphic encryption Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Cryptographic PrimitiveEngineeringSecure Pattern MatchingString-searching AlgorithmInformation Security	2013	99
New packing method in somewhat homomorphic encryption and its applications Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Security and Communication Networks Cryptographic PrimitiveData ConfidentialityEngineeringMeaningful ComputationsInformation Security	2015	36
Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption Dung Hoang Duong, Pradeep Kumar Mishra, Masaya Yasuda Tatra Mountains Mathematical Publications Cryptographic PrimitiveData ConfidentialityEngineeringLwe-based Homomorphic EncryptionPost-quantum Cryptography	2016	32
Faster PCA and Linear Regression through Hypercubes in HElib Deevashwer Rathee, Pradeep Kumar Mishra, Masaya Yasuda Cryptographic PrimitiveEngineeringAlgorithmic LibraryInformation SecurityInformation Forensics	2018	22
Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption Masaya Yasuda Information Security Journal A Global Perspective Distance ComputationCryptographic PrimitiveBiometric Feature VectorEngineeringBiometric Privacy	2017	16
Computational hardness of IFP and ECDLP Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Applicable Algebra in Engineering Communication and Computing Mathematical ProgrammingComputational Complexity TheoryEngineeringFormal MethodsComputational Complexity	2016	15
A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram–Schmidt lengths Masaya Yasuda, Junpei Yamaguchi Designs Codes and Cryptography EngineeringGram–schmidt LengthsNew Polynomial-time VariantComputer ScienceDeep Learning	2019	14

Page 1