Symmetric Private Polynomial Computation From Lagrange Encoding

The problem of <inline-formula> <tex-math notation="LaTeX">X </tex-math></inline-formula>-secure <inline-formula> <tex-math notation="LaTeX">T </tex-math></inline-formula>-colluding symmetric Private Polynomial Computation (PPC) fro...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 68; no. 4; pp. 2704 - 2718
Main Authors:	Zhu, Jinbao, Yan, Qifa, Tang, Xiaohu, Li, Songze
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Codes Complexity computation complexity Computational complexity Costs Decoding Encoding Evaluation Fields (mathematics) Functions (mathematics) Lagrange encoding Polynomials Private computation Servers symmetric private polynomial computation Systematics
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!