( en | de | ru )

 

Disambiguation of "Bogdanov, Andrej"

Author of the publication

copydeleteadd this publication to your clipboard
Bounded Indistinguishability for Simple Sources.

, , , , , and . Electron. Colloquium Comput. Complex., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Iouri Bogdanov

Mikhail Bogdanov

Andrey Bogdanov

Olga Bogdanov

Kirill Bogdanov

 

Other publications of authors with the same name

Homomorphic encryption from codes., and . IACR Cryptology ePrint Archive, (2011)Input Locality and Hardness Amplification., and . TCC, volume 6597 of Lecture Notes in Computer Science, page 1-18. Springer, (2011)Homomorphic Evaluation Requires Depth., and . TCC (A1), volume 9562 of Lecture Notes in Computer Science, page 365-371. Springer, (2016)Unconditionally Secure Computation Against Low-Complexity Leakage., , and . CRYPTO (2), volume 11693 of Lecture Notes in Computer Science, page 387-416. Springer, (2019)Hard Functions for Low-Degree Polynomials over Prime Fields., , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 120-131. Springer, (2011)Limits of Provable Security for Homomorphic Encryption., and . CRYPTO (1), volume 8042 of Lecture Notes in Computer Science, page 111-128. Springer, (2013)Public-Key Encryption from Continuous LWE., , , and . IACR Cryptol. ePrint Arch., (2022)Bounded Indistinguishability for Simple Sources., , , , , and . ITCS, volume 215 of LIPIcs, page 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pseudorandomness for Linear Length Branching Programs and Stack Machines., , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 447-458. Springer, (2012)More on Noncommutative Polynomial Identity Testing., and . CCC, page 92-99. IEEE Computer Society, (2005)