Andrej Bogdanov

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 59

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

CoRR

ICALP

Publications

Azim Ospanov, Jingwei Zhang, Mohammad Jalali, Xuenan Cao, Andrej Bogdanov, Farzan Farnia
Towards a Scalable Reference-Free Evaluation of Generative Models. CoRR (2024)
Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, Mehdi Tibouchi
CDS Composition of Multi-round Protocols. CRYPTO (9) (2024)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
Bounded Simultaneous Messages. CoRR (2023)
Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh, John C. S. Lui
Classical Simulation of One-Query Quantum Distinguishers. APPROX/RANDOM (2023)
Andrej Bogdanov
Csirmaz's Duality Conjecture and Threshold Secret Sharing. ITC (2023)
Andrej Bogdanov, Pravesh K. Kothari, Alon Rosen
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. TCC (1) (2023)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
Bounded Simultaneous Messages. FSTTCS (2023)
Andrej Bogdanov, Alon Rosen
Nondeterministic Interactive Refutations for Nearest Boolean Vector. ICALP (2023)
Andrej Bogdanov, TsunMing Cheung, Krishnamoorthy Dinesh, John C. S. Lui
Classical simulation of one-query quantum distinguishers. Electron. Colloquium Comput. Complex. (2023)
Andrej Bogdanov, Pravesh Kothari, Alon Rosen
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. IACR Cryptol. ePrint Arch. 2023 (2023)
Andrej Bogdanov, Pravesh Kothari, Alon Rosen
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. Electron. Colloquium Comput. Complex. (2023)
Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen
Public-Key Encryption from Continuous LWE. IACR Cryptol. ePrint Arch. 2022 (2022)
Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen
Public-Key Encryption from Continuous LWE. Electron. Colloquium Comput. Complex. 29 (2022)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35 (1) (2022)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan
Bounded Indistinguishability for Simple Sources. ITCS (2022)
Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne
Hitting Sets for Regular Branching Programs. CCC (2022)
Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen
Public-Key Encryption from Homogeneous CLWE. TCC (2) (2022)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35 (2) (2022)
Andrej Bogdanov, Gautam Prakriya
Direct Sum and Partitionability Testing over General Groups. ICALP (2021)
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
Non-Interactive Composition of Sigma-Protocols via Share-then-Hash. IACR Cryptol. ePrint Arch. 2021 (2021)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 34 (4) (2021)
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
Acyclicity Programming for Sigma-Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Scott Aaronson, Andris Ambainis, Andrej Bogdanov, Krishnamoorthy Dinesh, Cheung Tsun Ming
On quantum versus classical query complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan
Bounded Indistinguishability for Simple Sources. Electron. Colloquium Comput. Complex. 28 (2021)
Andrej Bogdanov
A Gentle Introduction to Zero-Knowledge. ICT Innovations (2021)
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
Acyclicity Programming for Sigma-Protocols. TCC (1) (2021)
Andrej Bogdanov, Baoxiang Wang
Learning and Testing Variable Partitions. ITCS (2020)
Andrej Bogdanov, Siyao Guo, Ilan Komargodski
Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory Comput. 16 (2020)
Andrej Bogdanov, Baoxiang Wang
Learning and Testing Variable Partitions. CoRR (2020)
Andrej Bogdanov, Gautam Prakriya
Direct Sum and Partitionability Testing over General Groups. Electron. Colloquium Comput. Complex. 27 (2020)
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
Non-interactive Composition of Sigma-Protocols via Share-then-Hash. ASIACRYPT (3) (2020)
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson
Approximate degree, secret sharing, and concentration phenomena. Electron. Colloquium Comput. Complex. 26 (2019)
Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan
XOR Codes and Sparse Learning Parity with Noise. SODA (2019)
Xishi Nicholas Wang, Amitalok J. Budkuley, Andrej Bogdanov, Sidharth Jaggi
When are large codes possible for AVCs? ISIT (2019)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Unconditionally Secure Computation Against Low-Complexity Leakage. CRYPTO (2) (2019)
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson
Approximate Degree, Secret Sharing, and Concentration Phenomena. APPROX-RANDOM (2019)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Unconditionally Secure Computation Against Low-Complexity Leakage. IACR Cryptol. ePrint Arch. 2019 (2019)
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson
Approximate degree, secret sharing, and concentration phenomena. CoRR (2019)
Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo
Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. APPROX-RANDOM (2018)
Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan
XOR Codes and Sparse Random Linear Equations with Noise. Electron. Colloquium Comput. Complex. 25 (2018)
Andrej Bogdanov
Small Bias Requires Large Formulas. ICALP (2018)
Andrej Bogdanov
Approximate degree of AND via Fourier analysis. Electron. Colloquium Comput. Complex. 25 (2018)
Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo
Complete Classification of Generalized Santha-Vazirani Sources. CoRR (2017)
Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo
Complete Classi fication of Generalized Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. 24 (2017)
Andrej Bogdanov, Alon Rosen
Pseudorandom Functions: Three Decades Later. IACR Cryptol. ePrint Arch. 2017 (2017)
Andrej Bogdanov, Christopher Williamson
Approximate Bounded Indistinguishability. ICALP (2017)
Andrej Bogdanov, Alon Rosen
Pseudorandom Functions: Three Decades Later. Electron. Colloquium Comput. Complex. 24 (2017)
Andrej Bogdanov
Small bias requires large formulas. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Andrej Bogdanov, Alon Rosen
A Dichotomy for Local Small-Bias Generators. J. Cryptol. 29 (3) (2016)
Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson
Bounded Indistinguishability and the Complexity of Recovering Secrets. CRYPTO (3) (2016)
Andrej Bogdanov, Chin Ho Lee
Homomorphic Evaluation Requires Depth. TCC (A1) (2016)
Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson
Bounded Indistinguishability and the Complexity of Recovering Secrets. IACR Cryptol. ePrint Arch. 2016 (2016)
Andrej Bogdanov, Siyao Guo, Ilan Komargodski
Threshold Secret Sharing Requires a Linear Size Alphabet. Electron. Colloquium Comput. Complex. 23 (2016)
Andrej Bogdanov, Siyao Guo, Ilan Komargodski
Threshold Secret Sharing Requires a Linear Size Alphabet. TCC (B2) (2016)
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) (2016)
Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson
Bounded Indistinguishability and the Complexity of Recovering Secrets. Electron. Colloquium Comput. Complex. 22 (2015)
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen
On the Hardness of Learning with Rounding over Small Modulus. IACR Cryptol. ePrint Arch. 2015 (2015)
Andrej Bogdanov, Christina Brzuska
On Basing Size-Verifiable One-Way Functions on NP-Hardness. TCC (1) (2015)
Andrej Bogdanov, Chin Ho Lee
Homomorphic evaluation requires depth. IACR Cryptol. ePrint Arch. 2015 (2015)
Andrej Bogdanov, Christina Brzuska
On Basing Size-Verifiable One-Way Functions on NP-Hardness. Electron. Colloquium Comput. Complex. 21 (2014)
Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen
. ITCS (2014)
Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen
. Electron. Colloquium Comput. Complex. 21 (2014)
Andrej Bogdanov, Siyao Guo
Sparse extractor families for all the entropy. ITCS (2013)
Andrej Bogdanov, Chin Ho Lee
Limits of Provable Security for Homomorphic Encryption. CRYPTO (1) (2013)
Andrej Bogdanov, Alon Rosen
Input Locality and Hardness Amplification. J. Cryptol. 26 (1) (2013)
Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9 (2013)
Andrej Bogdanov, Chin Ho Lee
Limits of provable security for homomorphic encryption. IACR Cryptol. ePrint Arch. 2013 (2013)
Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka
Hard Functions for Low-Degree Polynomials over Prime Fields. ACM Trans. Comput. Theory 5 (2) (2013)
Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan
Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM (2012)
Andrej Bogdanov, Siyao Guo
Sparse extractor families for all the entropy. Electron. Colloquium Comput. Complex. 19 (2012)
Andrej Bogdanov, Chin Ho Lee
On the depth complexity of homomorphic encryption schemes. Electron. Colloquium Comput. Complex. 19 (2012)
Benny Applebaum, Andrej Bogdanov, Alon Rosen
A Dichotomy for Local Small-Bias Generators. TCC (2012)
Andrej Bogdanov, Chin Ho Lee
Limits of provable security for homomorphic encryption. Electron. Colloquium Comput. Complex. 19 (2012)
Andrej Bogdanov, Siyao Guo
Sparse extractor families for all the entropy CoRR (2012)
Andrej Bogdanov, Youming Qiao
On the security of Goldreich's one-way function. Comput. Complex. 21 (1) (2012)
Benny Applebaum, Andrej Bogdanov, Alon Rosen
A Dichotomy for Local Small-Bias Generators. Electron. Colloquium Comput. Complex. 18 (2011)
Andrej Bogdanov, Chin Ho Lee
Homomorphic encryption from codes. IACR Cryptol. ePrint Arch. 2011 (2011)
Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel
The Computational Complexity of Estimating MCMC Convergence Time. APPROX-RANDOM (2011)
Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan
Pseudorandomness for read-once formulas. Electron. Colloquium Comput. Complex. 18 (2011)
Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan
Pseudorandomness for Read-Once Formulas. FOCS (2011)
Andrej Bogdanov, Alon Rosen
Input locality and hardness amplification. Electron. Colloquium Comput. Complex. 18 (2011)
Andrej Bogdanov, Chin Ho Lee
Homomorphic encryption from codes CoRR (2011)
Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka
Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS (2011)
Andrej Bogdanov, Elchanan Mossel
On Extracting Common Random Bits From Correlated Sources. IEEE Trans. Inf. Theory 57 (10) (2011)
Andrej Bogdanov, Alon Rosen
Input Locality and Hardness Amplification. TCC (2011)
Benny Applebaum, Andrej Bogdanov, Alon Rosen
A Dichotomy for Local Small-Bias Generators. IACR Cryptol. ePrint Arch. 2011 (2011)
Andrej Bogdanov, Kunal Talwar, Andrew Wan
Hard Instances for Satisfiability and Quasi-one-way Functions. ICS (2010)
Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel
The Computational Complexity of Estimating Convergence Time CoRR (2010)
Andrej Bogdanov, Elchanan Mossel
On extracting common random bits from correlated sources CoRR (2010)
Andrej Bogdanov, Emanuele Viola
Pseudorandom Bits for Polynomials. SIAM J. Comput. 39 (6) (2010)
Andrej Bogdanov, Fan Li
A better tester for bipartiteness? CoRR (2010)
Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. 16 (2009)
Andrej Bogdanov, Youming Qiao
On the Security of Goldreich's One-Way Function. APPROX-RANDOM (2009)
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
The Complexity of Distinguishing Markov Random Fields. APPROX-RANDOM (2008)
Andrej Bogdanov, Emanuele Viola
Pseudorandom Bits for Polynomials. FOCS (2007)
Andrej Bogdanov, Emanuele Viola
Pseudorandom bits for polynomials. Electron. Colloquium Comput. Complex. 14 (081) (2007)
Andrej Bogdanov, Muli Safra
Hardness Amplification for Errorless Heuristics. FOCS (2007)
Andrej Bogdanov, Muli Safra
Hardness amplification for errorless heuristics. Electron. Colloquium Comput. Complex. 14 (102) (2007)
Andrej Bogdanov, Luca Trevisan
Average-Case Complexity. Found. Trends Theor. Comput. Sci. 2 (1) (2006)
Andrej Bogdanov, Luca Trevisan
Average-Case Complexity. Electron. Colloquium Comput. Complex. 13 (073) (2006)

Andrej Bogdanov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrej Bogdanov