default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSriram Keelveedhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c10]Mihir Bellare, Rafael Dowsley
, Sriram Keelveedhi:
How Secure is Deterministic Encryption? Public Key Cryptography 2015: 52-73- [c9]Mihir Bellare, Sriram Keelveedhi:
Interactive Message-Locked Encryption and Secure Deduplication. Public Key Cryptography 2015: 516-538 - [i9]Mihir Bellare, Sriram Keelveedhi:
Interactive Message-Locked Encryption and Secure Deduplication. IACR Cryptol. ePrint Arch. 2015: 52 (2015) - 2014
- [b1]Sriram Keelveedhi:
Encryption when messages and keys are related /. University of California, San Diego, USA, 2014 - [c8]Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi:
Cryptography from Compression Functions: The UCE Bridge to the ROM. CRYPTO (1) 2014: 169-187 - [i8]Mihir Bellare, Rafael Dowsley, Sriram Keelveedhi:
How Secure is Deterministic Encryption? IACR Cryptol. ePrint Arch. 2014: 376 (2014) - [i7]Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi:
Cryptography from Compression Functions: The UCE Bridge to the ROM. IACR Cryptol. ePrint Arch. 2014: 518 (2014) - 2013
- [c7]Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi:
Instantiating Random Oracles via UCEs. CRYPTO (2) 2013: 398-415 - [c6]Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart:
Message-Locked Encryption and Secure Deduplication. EUROCRYPT 2013: 296-312 - [c5]Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, Phillip Rogaway:
Efficient Garbling from a Fixed-Key Blockcipher. IEEE Symposium on Security and Privacy 2013: 478-492 - [c4]Sriram Keelveedhi, Mihir Bellare, Thomas Ristenpart:
DupLESS: Server-Aided Encryption for Deduplicated Storage. USENIX Security Symposium 2013: 179-194 - [i6]Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi:
Instantiating Random Oracles via UCEs. IACR Cryptol. ePrint Arch. 2013: 424 (2013) - [i5]Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, Phillip Rogaway:
Efficient Garbling from a Fixed-Key Blockcipher. IACR Cryptol. ePrint Arch. 2013: 426 (2013) - [i4]Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart:
DupLESS: Server-Aided Encryption for Deduplicated Storage. IACR Cryptol. ePrint Arch. 2013: 429 (2013) - 2012
- [c3]Keaton Mowery, Sriram Keelveedhi, Hovav Shacham:
Are AES x86 cache timing attacks still feasible? CCSW 2012: 19-24 - [i3]Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart:
Message-Locked Encryption and Secure Deduplication. IACR Cryptol. ePrint Arch. 2012: 631 (2012) - 2011
- [c2]Mihir Bellare, David Cash, Sriram Keelveedhi:
Ciphers that securely encipher their own keys. CCS 2011: 423-432 - [c1]Mihir Bellare, Sriram Keelveedhi:
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. CRYPTO 2011: 610-629 - [i2]Mihir Bellare, Sriram Keelveedhi:
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. IACR Cryptol. ePrint Arch. 2011: 269 (2011) - [i1]Mihir Bellare, David Cash, Sriram Keelveedhi:
Ciphers that Securely Encipher their own Keys. IACR Cryptol. ePrint Arch. 2011: 432 (2011)
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 2025-01-09 13:07 CET 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:
