JOURNAL ARTICLE
Efficient verifiable computation over quotient polynomial rings
Jai Hyun ParkJung Hee CheonDongwoo Kim
Year: 2022 Journal: International Journal of Information Security Vol: 21 (5)Pages: 953-971 Publisher: Springer Science+Business Media
Keywords:
Computer science Homomorphic encryption Quotient Bottleneck Polynomial Polynomial ring Computation Ciphertext Verifiable secret sharing Finite field Theoretical computer science Cryptography Time complexity Encryption Discrete mathematics Mathematics Algorithm Combinatorics Computer network Programming language
Metrics
1
Cited By
0.20
FWCI (Field Weighted Citation Impact)
36
Refs
0.50
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Cryptography and Data Security
Physical Sciences → Computer Science → Artificial Intelligence
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Cryptography and Residue Arithmetic
Physical Sciences → Computer Science → Information Systems
Related Documents
JOURNAL ARTICLE
Quotient rings of polynomial rings
Journal: manuscripta mathematica Year: 1980 Vol: 31 (1-3)Pages: 167-196
JOURNAL ARTICLE
Practical fully homomorphic encryption over polynomial quotient rings
Alexander ZhirovOlga ZhirovaSergey Krendelev
Year: 2013 Vol: 168 Pages: 70-75
JOURNAL ARTICLE
Practical Fully Homomorphic Encryption for Integers over Polynomial Quotient Rings
Alexander ZhirovOlga ZhirovaSergey Krendelev
Journal: International Journal for Information Security Research Year: 2014 Vol: 4 (3)Pages: 469-477
BOOK-CHAPTER
Efficient Multi-party Computation over Rings
Ronald CramerSerge FehrYuval IshaiEyal Kushilevitz
Lecture notes in computer science Year: 2003 Pages: 596-613
JOURNAL ARTICLE
Ideals and quotient rings of skew polynomial rings
Jerry D. RosenMary Peles Rosen
Journal: Communications in Algebra Year: 1993 Vol: 21 (3)Pages: 799-823