COMPUTATIONALLY EFFICIENT PRIVATE INFORMATION RETRIEVAL PROTOCOL
This paper describes a new computationally efficient private information retrieval protocol for one q-ary symbol retrieving. The main advantage of the proposed solution lies in a low computational complexity of information extraction procedure, as well as the constructive simplicity and flexibility...
Main Authors: | A. V. Afanasyeva, S. V. Bezzateev |
---|---|
Format: | Article |
Language: | English |
Published: |
Saint Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO University)
2016-03-01
|
Series: | Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki |
Subjects: | |
Online Access: | http://ntv.ifmo.ru/file/article/15184.pdf |
Similar Items
-
Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility
by: Ramy Taki Eldin, et al.
Published: (2019-01-01) -
DIFFERENTIATION OF POLYNOMIALS IN SEVERAL VARIABLES OVER GALOIS FIELDS OF FUZZY CARDINALITY AND APPLICATIONS TO REED-MULLER CODES
by: V. M. Deundyak, et al.
Published: (2018-09-01) -
CONVEYOR ANALOG OF MATRIX DIFFIE-HELLMAN PROOTOKOL
by: A.J. Beletsky, et al.
Published: (2013-03-01) -
Polynomials with minimal value set over Galois rings
by: Maria T. Acosta-De-Orozco, et al.
Published: (1991-01-01) -
Some results on deep holes of generalized projective Reed-Solomon codes
by: Xiaofan Xu, et al.
Published: (2019-02-01)