Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshutosh Kumar 0002
Person information
- affiliation: University of California, Los Angeles, Computer Science Department, CA, USA
- affiliation (former): International Institute of Information Technology, Hyderabad, India
Other persons with the same name
- Ashutosh Kumar — disambiguation page
- Ashutosh Kumar 0001
![[0000-0003-3754-8996]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3754-8996")
— RIKEN, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c5]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman:
Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS 2020: 1226-1242- [i7]Ashutosh Kumar, Raghu Meka, David Zuckerman:
Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. Electron. Colloquium Comput. Complex. TR20 (2020) - [i6]Ashutosh Kumar, Raghu Meka, David Zuckerman:
Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2020: 473 (2020)
2010 – 2019
- 2019
- [c4]Ashutosh Kumar, Raghu Meka, Amit Sahai:
Leakage-Resilient Secret Sharing Against Colluding Parties. FOCS 2019: 636-660 - 2018
- [j2]Ravi Kishore, Ashutosh Kumar, Chiranjeevi Vanarasa, Kannan Srinathan:
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission. IEEE Trans. Inf. Theory 64(2): 1404-1422 (2018) - [c3]Vipul Goyal, Ashutosh Kumar:
Non-malleable Secret Sharing for General Access Structures. CRYPTO (1) 2018: 501-530 - [c2]Vipul Goyal, Ashutosh Kumar:
Non-malleable secret sharing. STOC 2018: 685-698 - [i5]Ashutosh Kumar, Raghu Meka, Amit Sahai:
Leakage-Resilient Secret Sharing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i4]Vipul Goyal, Ashutosh Kumar:
Non-Malleable Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 316 (2018) - [i3]Vipul Goyal, Ashutosh Kumar:
Non-Malleable Secret Sharing for General Access Structures. IACR Cryptol. ePrint Arch. 2018: 750 (2018) - [i2]Ashutosh Kumar, Raghu Meka, Amit Sahai:
Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 1138 (2018) - [i1]Ravi Kishore, Ashutosh Kumar, Chiranjeevi Vanarasa, Kannan Srinathan:
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission. IACR Cryptol. ePrint Arch. 2018: 1167 (2018) - 2015
- [j1]Dip Sankar Banerjee, Ashutosh Kumar, Meher Chaitanya, Shashank Sharma, Kishore Kothapalli:
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures. J. Parallel Distributed Comput. 76: 81-93 (2015) - [c1]Ravi Kishore, Ashutosh Kumar, Chiranjeevi Vanarasa, Kannan Srinathan:
Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity. ICITS 2015: 33-50
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-05-19 03:05 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:
