default search action
Eric Miles
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j3]Hamidreza Jahanjou, Eric Miles, Emanuele Viola:
Local reduction. Inf. Comput. 261: 281-295 (2018) - 2016
- [c10]Eric Miles, Amit Sahai, Mark Zhandry:
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. CRYPTO (2) 2016: 629-658 - [c9]Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry:
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits. EUROCRYPT (2) 2016: 764-791 - [c8]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. TCC (B2) 2016: 241-268 - [i20]Eric Miles, Amit Sahai, Mark Zhandry:
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. IACR Cryptol. ePrint Arch. 2016: 147 (2016) - [i19]Eric Miles, Emanuele Viola:
On the complexity of constructing pseudorandom functions (especially when they don't exist). IACR Cryptol. ePrint Arch. 2016: 343 (2016) - [i18]Eric Miles, Amit Sahai, Mark Zhandry:
Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks. IACR Cryptol. ePrint Arch. 2016: 588 (2016) - [i17]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. IACR Cryptol. ePrint Arch. 2016: 817 (2016) - 2015
- [j2]Eric Miles, Emanuele Viola:
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. J. ACM 62(6): 46:1-46:29 (2015) - [j1]Eric Miles, Emanuele Viola:
On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist). J. Cryptol. 28(3): 509-532 (2015) - [c7]Jean-Sébastien Coron, Craig Gentry, Shai Halevi, Tancrède Lepoint, Hemanta K. Maji, Eric Miles, Mariana Raykova, Amit Sahai, Mehdi Tibouchi:
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations. CRYPTO (1) 2015: 247-266 - [c6]Hamid Jahanjou, Eric Miles, Emanuele Viola:
Local Reductions. ICALP (1) 2015: 749-760 - [i16]Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry:
Post-Zeroizing Obfuscation: The case of Evasive Circuits. IACR Cryptol. ePrint Arch. 2015: 167 (2015) - [i15]Jean-Sébastien Coron, Craig Gentry, Shai Halevi, Tancrède Lepoint, Hemanta K. Maji, Eric Miles, Mariana Raykova, Amit Sahai, Mehdi Tibouchi:
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations. IACR Cryptol. ePrint Arch. 2015: 596 (2015) - 2014
- [c5]Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin:
Amplifying Privacy in Privacy Amplification. CRYPTO (2) 2014: 183-198 - [c4]Eric Miles:
Iterated group products and leakage resilience against NC1. ITCS 2014: 261-268 - [i14]Hamidreza Jahanjou, Eric Miles, Emanuele Viola:
Succinct and explicit circuits for sorting and connectivity. Electron. Colloquium Comput. Complex. TR14 (2014) - [i13]Eric Miles, Amit Sahai, Mor Weiss:
Protecting obfuscation against arithmetic attacks. IACR Cryptol. ePrint Arch. 2014: 878 (2014) - 2013
- [c3]Eric Miles, Emanuele Viola:
Shielding circuits with groups. STOC 2013: 251-260 - [i12]Hamidreza Jahanjou, Eric Miles, Emanuele Viola:
Local reductions. CoRR abs/1311.3171 (2013) - [i11]Eric Miles:
Iterated group products and leakage resilience against NC^1. CoRR abs/1312.3193 (2013) - [i10]Hamidreza Jahanjou, Eric Miles, Emanuele Viola:
Local reductions. Electron. Colloquium Comput. Complex. TR13 (2013) - [i9]Eric Miles, Emanuele Viola:
Shielding circuits with groups. Electron. Colloquium Comput. Complex. TR13 (2013) - [i8]Eric Miles, Emanuele Viola:
Shielding circuits with groups. IACR Cryptol. ePrint Arch. 2013: 1 (2013) - [i7]Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin:
Amplifying Privacy in Privacy Amplification. IACR Cryptol. ePrint Arch. 2013: 723 (2013) - [i6]Eric Miles:
Iterated group products and leakage resilience against NC1. IACR Cryptol. ePrint Arch. 2013: 815 (2013) - 2012
- [c2]Eric Miles, Emanuele Viola:
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. CRYPTO 2012: 68-85 - [i5]Zahra Jafargholi, Hamidreza Jahanjou, Eric Miles, Jaideep Ramachandran, Emanuele Viola:
From RAM to SAT. Electron. Colloquium Comput. Complex. TR12 (2012) - [i4]Eric Miles, Emanuele Viola:
On the complexity of constructing pseudorandom functions (especially when they don't exist). Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c1]Eric Miles, Emanuele Viola:
On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. TCC 2011: 522-539 - [i3]Eric Miles, Emanuele Viola:
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. Electron. Colloquium Comput. Complex. TR11 (2011) - [i2]Eric Miles, Emanuele Viola:
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. IACR Cryptol. ePrint Arch. 2011: 226 (2011)
2000 – 2009
- 2008
- [i1]Chris Pollett, Eric Miles:
Alternating Hierarchies for Time-Space Tradeoffs. CoRR abs/0801.1307 (2008)
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-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint