default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkshay Degwekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. J. Cryptol. 34(2): 10 (2021)- [j2]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure Versus Hardness Through the Obfuscation Lens. SIAM J. Comput. 50(1): 98-144 (2021) - 2020
- [c10]Marshall Ball
, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27 - [i15]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. TR20 (2020) - [i14]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020: 395 (2020)
2010 – 2019
- 2019
- [c9]Akshay Degwekar, Preetum Nakkiran, Vinod Vaikuntanathan:
Computational Limitations in Robust Classification and Win-Win Results. COLT 2019: 994-1028 - [c8]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. TCC (2) 2019: 311-332 - [c7]Nir Bitansky, Akshay Degwekar:
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. TCC (1) 2019: 422-450 - [i13]Akshay Degwekar, Vinod Vaikuntanathan:
Computational Limitations in Robust Classification and Win-Win Results. CoRR abs/1902.01086 (2019) - [i12]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. Electron. Colloquium Comput. Complex. TR19 (2019) - [i11]Akshay Degwekar, Vinod Vaikuntanathan:
Computational Limitations in Robust Classification and Win-Win Results. IACR Cryptol. ePrint Arch. 2019: 218 (2019) - [i10]Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2019: 653 (2019) - [i9]Nir Bitansky, Akshay Degwekar:
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. IACR Cryptol. ePrint Arch. 2019: 686 (2019) - 2018
- [c6]Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. CRYPTO (1) 2018: 531-561 - [c5]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. CRYPTO (3) 2018: 674-697 - [c4]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) 2018: 133-161 - [i8]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2018: 548 (2018) - 2017
- [c3]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs. Hardness Through the Obfuscation Lens. CRYPTO (1) 2017: 696-723 - [i7]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i6]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. Electron. Colloquium Comput. Complex. TR17 (2017) - [i5]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. IACR Cryptol. ePrint Arch. 2017: 489 (2017) - 2016
- [c2]Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Fine-Grained Cryptography. CRYPTO (3) 2016: 533-562 - [i4]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs Hardness through the Obfuscation Lens. Electron. Colloquium Comput. Complex. TR16 (2016) - [i3]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs Hardness through the Obfuscation Lens. IACR Cryptol. ePrint Arch. 2016: 574 (2016) - [i2]Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Fine-grained Cryptography. IACR Cryptol. ePrint Arch. 2016: 580 (2016) - 2015
- [j1]Akshay Degwekar, Kenza Guenda, T. Aaron Gulliver:
Extending construction X for quantum error-correcting codes. ACM Commun. Comput. Algebra 49(1): 18 (2015) - 2014
- [c1]Akshay Degwekar, Kenza Guenda, T. Aaron Gulliver:
Extending Construction X for Quantum Error-Correcting Codes. ICMCTA 2014: 141-152 - 2013
- [i1]Akshay Degwekar, Kenza Guenda, T. Aaron Gulliver:
Extending Construction X for Quantum Error-Correcting Codes. CoRR abs/1312.6064 (2013)
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:36 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:
