default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrej Bogdanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c48]Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, Mehdi Tibouchi:
CDS Composition of Multi-round Protocols. CRYPTO (9) 2024: 391-423- [i53]Azim Ospanov, Jingwei Zhang, Mohammad Jalali, Xuenan Cao, Andrej Bogdanov, Farzan Farnia:
Towards a Scalable Reference-Free Evaluation of Generative Models. CoRR abs/2407.02961 (2024) - [i52]Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik:
Low-degree Security of the Planted Random Subgraph Problem. CoRR abs/2409.16227 (2024) - [i51]Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik:
Low-degree Security of the Planted Random Subgraph Problem. IACR Cryptol. ePrint Arch. 2024: 1497 (2024) - 2023
- [c47]Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh
, John C. S. Lui:
Classical Simulation of One-Query Quantum Distinguishers. APPROX/RANDOM 2023: 43:1-43:17 - [c46]Andrej Bogdanov:
Csirmaz's Duality Conjecture and Threshold Secret Sharing. ITC 2023: 3:1-3:6 - [c45]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. FSTTCS 2023: 23:1-23:17 - [c44]Andrej Bogdanov, Alon Rosen:
Nondeterministic Interactive Refutations for Nearest Boolean Vector. ICALP 2023: 28:1-28:14 - [c43]Andrej Bogdanov, Pravesh K. Kothari, Alon Rosen:
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. TCC (1) 2023: 268-285 - [i50]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. CoRR abs/2310.00334 (2023) - [i49]Andrej Bogdanov, TsunMing Cheung, Krishnamoorthy Dinesh, John C. S. Lui:
Classical simulation of one-query quantum distinguishers. Electron. Colloquium Comput. Complex. TR23 (2023) - [i48]Andrej Bogdanov, Pravesh Kothari, Alon Rosen:
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. Electron. Colloquium Comput. Complex. TR23 (2023) - [i47]Andrej Bogdanov, Pravesh Kothari, Alon Rosen:
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. IACR Cryptol. ePrint Arch. 2023: 1049 (2023) - 2022
- [j13]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35(1): 2 (2022) - [j12]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35(2): 7 (2022) - [c42]Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne:
Hitting Sets for Regular Branching Programs. CCC 2022: 3:1-3:22 - [c41]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. ITCS 2022: 26:1-26:18 - [c40]Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Homogeneous CLWE. TCC (2) 2022: 565-592 - [i46]Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Continuous LWE. Electron. Colloquium Comput. Complex. TR22 (2022) - [i45]Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Continuous LWE. IACR Cryptol. ePrint Arch. 2022: 93 (2022) - 2021
- [j11]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 34(4): 38 (2021) - [c39]Andrej Bogdanov, Gautam Prakriya:
Direct Sum and Partitionability Testing over General Groups. ICALP 2021: 33:1-33:19 - [c38]Andrej Bogdanov:
A Gentle Introduction to Zero-Knowledge. ICT Innovations 2021: 3-10 - [c37]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Acyclicity Programming for Sigma-Protocols. TCC (1) 2021: 435-465 - [i44]Scott Aaronson, Andris Ambainis, Andrej Bogdanov, Krishnamoorthy Dinesh, Tsun Ming Cheung:
On quantum versus classical query complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i43]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. Electron. Colloquium Comput. Complex. TR21 (2021) - [i42]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Acyclicity Programming for Sigma-Protocols. IACR Cryptol. ePrint Arch. 2021: 135 (2021) - [i41]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: 457 (2021) - 2020
- [j10]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory Comput. 16: 1-18 (2020) - [c36]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Non-interactive Composition of Sigma-Protocols via Share-then-Hash. ASIACRYPT (3) 2020: 749-773 - [c35]Andrej Bogdanov, Baoxiang Wang:
Learning and Testing Variable Partitions. ITCS 2020: 37:1-37:22 - [i40]Andrej Bogdanov, Baoxiang Wang:
Learning and Testing Variable Partitions. CoRR abs/2003.12990 (2020) - [i39]Andrej Bogdanov, Gautam Prakriya:
Direct Sum and Partitionability Testing over General Groups. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c34]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate Degree, Secret Sharing, and Concentration Phenomena. APPROX-RANDOM 2019: 71:1-71:21 - [c33]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. CRYPTO (2) 2019: 387-416 - [c32]Xishi Nicholas Wang, Amitalok J. Budkuley, Andrej Bogdanov, Sidharth Jaggi:
When are large codes possible for AVCs? ISIT 2019: 632-636 - [c31]Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan:
XOR Codes and Sparse Learning Parity with Noise. SODA 2019: 986-1004 - [i38]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate degree, secret sharing, and concentration phenomena. CoRR abs/1906.00326 (2019) - [i37]Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate degree, secret sharing, and concentration phenomena. Electron. Colloquium Comput. Complex. TR19 (2019) - [i36]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. IACR Cryptol. ePrint Arch. 2019: 627 (2019) - 2018
- [c30]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. APPROX-RANDOM 2018: 30:1-30:15 - [c29]Andrej Bogdanov:
Small Bias Requires Large Formulas. ICALP 2018: 22:1-22:12 - [i35]Andrej Bogdanov:
Approximate degree of AND via Fourier analysis. Electron. Colloquium Comput. Complex. TR18 (2018) - [i34]Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan:
XOR Codes and Sparse Random Linear Equations with Noise. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c28]Andrej Bogdanov, Christopher Williamson:
Approximate Bounded Indistinguishability. ICALP 2017: 53:1-53:11 - [p1]Andrej Bogdanov, Alon Rosen:
Pseudorandom Functions: Three Decades Later. Tutorials on the Foundations of Cryptography 2017: 79-158 - [i33]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Complete Classification of Generalized Santha-Vazirani Sources. CoRR abs/1709.03053 (2017) - [i32]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Complete Classi fication of Generalized Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. TR17 (2017) - [i31]Andrej Bogdanov:
Small bias requires large formulas. Electron. Colloquium Comput. Complex. TR17 (2017) - [i30]Andrej Bogdanov, Alon Rosen:
Pseudorandom Functions: Three Decades Later. Electron. Colloquium Comput. Complex. TR17 (2017) - [i29]Andrej Bogdanov, Alon Rosen:
Pseudorandom Functions: Three Decades Later. IACR Cryptol. ePrint Arch. 2017: 652 (2017) - 2016
- [j9]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. J. Cryptol. 29(3): 577-596 (2016) - [c27]Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson:
Bounded Indistinguishability and the Complexity of Recovering Secrets. CRYPTO (3) 2016: 593-618 - [c26]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) 2016: 209-224 - [c25]Andrej Bogdanov, Chin Ho Lee:
Homomorphic Evaluation Requires Depth. TCC (A1) 2016: 365-371 - [c24]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear Size Alphabet. TCC (B2) 2016: 471-484 - [i28]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear Size Alphabet. Electron. Colloquium Comput. Complex. TR16 (2016) - [i27]Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson:
Bounded Indistinguishability and the Complexity of Recovering Secrets. IACR Cryptol. ePrint Arch. 2016: 565 (2016) - 2015
- [c23]Andrej Bogdanov, Christina Brzuska:
On Basing Size-Verifiable One-Way Functions on NP-Hardness. TCC (1) 2015: 1-6 - [i26]Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson:
Bounded Indistinguishability and the Complexity of Recovering Secrets. Electron. Colloquium Comput. Complex. TR15 (2015) - [i25]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: 769 (2015) - [i24]Andrej Bogdanov, Chin Ho Lee:
Homomorphic evaluation requires depth. IACR Cryptol. ePrint Arch. 2015: 1044 (2015) - 2014
- [c22]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. ITCS 2014: 251-260 - [i23]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. Electron. Colloquium Comput. Complex. TR14 (2014) - [i22]Andrej Bogdanov, Christina Brzuska:
On Basing Size-Verifiable One-Way Functions on NP-Hardness. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j8]Andrej Bogdanov, Alon Rosen:
Input Locality and Hardness Amplification. J. Cryptol. 26(1): 144-171 (2013) - [j7]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9: 283-293 (2013) - [j6]Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields. ACM Trans. Comput. Theory 5(2): 5:1-5:15 (2013) - [c21]Andrej Bogdanov, Chin Ho Lee:
Limits of Provable Security for Homomorphic Encryption. CRYPTO (1) 2013: 111-128 - [c20]Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. ITCS 2013: 553-560 - [i21]Andrej Bogdanov, Chin Ho Lee:
Limits of provable security for homomorphic encryption. IACR Cryptol. ePrint Arch. 2013: 344 (2013) - 2012
- [j5]Andrej Bogdanov, Youming Qiao:
On the security of Goldreich's one-way function. Comput. Complex. 21(1): 83-127 (2012) - [c19]Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM 2012: 447-458 - [c18]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. TCC 2012: 600-617 - [i20]Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. CoRR abs/1207.6260 (2012) - [i19]Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. Electron. Colloquium Comput. Complex. TR12 (2012) - [i18]Andrej Bogdanov, Chin Ho Lee:
Limits of provable security for homomorphic encryption. Electron. Colloquium Comput. Complex. TR12 (2012) - [i17]Andrej Bogdanov, Chin Ho Lee:
On the depth complexity of homomorphic encryption schemes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Andrej Bogdanov, Elchanan Mossel:
On Extracting Common Random Bits From Correlated Sources. IEEE Trans. Inf. Theory 57(10): 6351-6355 (2011) - [c17]Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel:
The Computational Complexity of Estimating MCMC Convergence Time. APPROX-RANDOM 2011: 424-435 - [c16]Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for Read-Once Formulas. FOCS 2011: 240-246 - [c15]Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS 2011: 120-131 - [c14]Andrej Bogdanov, Alon Rosen:
Input Locality and Hardness Amplification. TCC 2011: 1-18 - [i16]Andrej Bogdanov, Chin Ho Lee:
Homomorphic encryption from codes. CoRR abs/1111.4301 (2011) - [i15]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. Electron. Colloquium Comput. Complex. TR11 (2011) - [i14]Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for read-once formulas. Electron. Colloquium Comput. Complex. TR11 (2011) - [i13]Andrej Bogdanov, Alon Rosen:
Input locality and hardness amplification. Electron. Colloquium Comput. Complex. TR11 (2011) - [i12]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. IACR Cryptol. ePrint Arch. 2011: 512 (2011) - [i11]Andrej Bogdanov, Chin Ho Lee:
Homomorphic encryption from codes. IACR Cryptol. ePrint Arch. 2011: 622 (2011) - 2010
- [j3]Andrej Bogdanov, Emanuele Viola:
Pseudorandom Bits for Polynomials. SIAM J. Comput. 39(6): 2464-2486 (2010) - [c13]Andrej Bogdanov, Kunal Talwar, Andrew Wan:
Hard Instances for Satisfiability and Quasi-one-way Functions. ICS 2010: 290-300 - [i10]Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel:
The Computational Complexity of Estimating Convergence Time. CoRR abs/1007.0089 (2010) - [i9]Andrej Bogdanov, Elchanan Mossel:
On extracting common random bits from correlated sources. CoRR abs/1007.2315 (2010) - [i8]Andrej Bogdanov, Fan Li:
A better tester for bipartiteness? CoRR abs/1011.0531 (2010)
2000 – 2009
- 2009
- [c12]Andrej Bogdanov, Youming Qiao:
On the Security of Goldreich's One-Way Function. APPROX-RANDOM 2009: 392-405 - [i7]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c11]Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan:
The Complexity of Distinguishing Markov Random Fields. APPROX-RANDOM 2008: 331-342 - 2007
- [c10]Andrej Bogdanov, Emanuele Viola:
Pseudorandom Bits for Polynomials. FOCS 2007: 41-51 - [c9]Andrej Bogdanov, Muli Safra:
Hardness Amplification for Errorless Heuristics. FOCS 2007: 418-426 - [i6]Andrej Bogdanov, Muli Safra:
Hardness amplification for errorless heuristics. Electron. Colloquium Comput. Complex. TR07 (2007) - [i5]Andrej Bogdanov, Emanuele Viola:
Pseudorandom bits for polynomials. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Andrej Bogdanov, Luca Trevisan:
Average-Case Complexity. Found. Trends Theor. Comput. Sci. 2(1) (2006) - [j1]Andrej Bogdanov, Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems. SIAM J. Comput. 36(4): 1119-1159 (2006) - [i4]Andrej Bogdanov, Luca Trevisan:
Average-Case Complexity. CoRR abs/cs/0606037 (2006) - [i3]Andrej Bogdanov, Luca Trevisan:
Average-Case Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c8]Andrej Bogdanov, Hoeteck Wee:
More on Noncommutative Polynomial Identity Testing. CCC 2005: 92-99 - [c7]Andrej Bogdanov:
Pseudorandom generators for low degree polynomials. STOC 2005: 21-30 - [i2]Andrej Bogdanov, Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c6]Andrej Bogdanov, Hoeteck Wee:
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. APPROX-RANDOM 2004: 298-309 - [c5]Andrej Bogdanov, Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs. CCC 2004: 75-81 - [c4]Andrej Bogdanov, Elitza N. Maneva, Samantha J. Riesenfeld:
Power-aware base station positioning for sensor networks. INFOCOM 2004 - 2003
- [c3]Andrej Bogdanov, Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems. FOCS 2003: 308-317 - 2002
- [c2]Andrej Bogdanov, Kenji Obata, Luca Trevisan:
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. FOCS 2002: 93-102 - [c1]Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch:
Mechanical Translation of I/O Automaton Specifications into First-Order Logic. FORTE 2002: 364-368 - [i1]Andrej Bogdanov, Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs. Electron. Colloquium Comput. Complex. TR02 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
