An approach to quantitative analysis of resistance of equivalent transformations of algebraic circuits.
A system of computations on encrypted data such that
— transformation of encryption is effective, i.e. can be performed in polynomial time on the size of circuit C;
— the size of scheme A' differs not essentially from the size of initial scheme A;
— lower bounds on resistance of circuit is exponential
Proceedings of the Institute for System Programming, vol. 6 (in Russian), 2004, Стр. 157-178.
ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).Full text of the paper in pdf (in Russian) Back to the contents of the volume