Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sriram Keelveedhi

dblp:53/9958 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 7 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
7 papers
Cryptographic primitives and cryptanalysis · 81% Cryptographic protocols and secure computation · 14% Systems and software security · 5%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 50% Storage systems · 50%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
hash functions
0.422014
Cryptography from Compression Functions: The UCE Bridge to the ROM · CRYPTO (1) 2014
Instantiating Random Oracles via UCEs · CRYPTO (2) 2013
Cryptographic primitives and cryptanalysis
random oracle model
0.422014
Cryptography from Compression Functions: The UCE Bridge to the ROM · CRYPTO (1) 2014
Instantiating Random Oracles via UCEs · CRYPTO (2) 2013
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions
compression functions
0.212014
Cryptography from Compression Functions: The UCE Bridge to the ROM · CRYPTO (1) 2014
Cryptographic primitives and cryptanalysis › block cipher
AES
0.212013
Efficient Garbling from a Fixed-Key Blockcipher · IEEE Symposium on Security and Privacy 2013
Cryptographic primitives and cryptanalysis
block cipher
0.212013
Efficient Garbling from a Fixed-Key Blockcipher · IEEE Symposium on Security and Privacy 2013
Cryptographic protocols and secure computation
garbled circuits
0.212013
Efficient Garbling from a Fixed-Key Blockcipher · IEEE Symposium on Security and Privacy 2013
Cryptographic primitives and cryptanalysis › encryption
message-locked encryption
0.212013
Message-Locked Encryption and Secure Deduplication · EUROCRYPT 2013
Cryptographic primitives and cryptanalysis › hash functions
UCE
0.212013
Instantiating Random Oracles via UCEs · CRYPTO (2) 2013
Cryptographic primitives and cryptanalysis
authenticated encryption
0.112011
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data · CRYPTO 2011
Systems and software security › secure storage
disk encryption
0.112011
Ciphers that securely encipher their own keys · CCS 2011
Cryptographic primitives and cryptanalysis › authenticated encryption
nonce-misuse resistance
0.112011
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data · CRYPTO 2011
Cryptographic primitives and cryptanalysis › block cipher
tweakable block cipher
0.112011
Ciphers that securely encipher their own keys · CCS 2011
Storage systems › data reduction
data deduplication
0.012013
DupLESS: Server-Aided Encryption for Deduplicated Storage · USENIX Security Symposium 2013
Cloud and datacenter computing › cloud storage
secure deduplication
0.012013
Message-Locked Encryption and Secure Deduplication · EUROCRYPT 2013

Methods — techniques the papers use, named apart from their topics

provable security · 0.5key management · 0.3blind encryption · 0.3random-permutation model · 0.2PRP-CCA security · 0.1
YearPublicationVenuePosition
2014 Cryptography from Compression Functions: The UCE Bridge to the ROM
Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi
CRYPTO (1)3
2013 Instantiating Random Oracles via UCEs
Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi
CRYPTO (2)3
2013 Message-Locked Encryption and Secure Deduplication
Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart
EUROCRYPT2
2013 Efficient Garbling from a Fixed-Key Blockcipher
abstract
We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-garbling. We provide such schemes making only one AES call per garbled-gate evaluation. On the theoretical side, we justify the security of these methods in the random-permutation model, where parties have access to a public random permutation. On the practical side, we provide the Just Garble system, which implements our schemes. Just Garble evaluates moderate-sized garbled-circuits at an amortized cost of 23.2 cycles per gate (7.25 nsec), far faster than any prior reported results.
Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, Phillip Rogaway
IEEE Symposium on Security and Privacy3
2013 DupLESS: Server-Aided Encryption for Deduplicated Storage
Sriram Keelveedhi, Mihir Bellare, Thomas Ristenpart
USENIX Security Symposium1
2011 Ciphers that securely encipher their own keys
abstract
In response to needs of disk encryption standardization bodies, we provide the first tweakable ciphers that are proven to securely encipher their own keys. We provide both a narrowblock design StE and a wideblock design EtE. Our proofs assume only standard PRP-CCA security of the underlying tweakable ciphers.
Mihir Bellare, David Cash, Sriram Keelveedhi
CCS3
2011 Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
Mihir Bellare, Sriram Keelveedhi
CRYPTO2