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

Sai Lakshmi Bhavana Obbattu

dblp:208/0827 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
5since 2021 · last 2022
0000-0002-6073-3711ORCID · corroborated

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

Security and privacy · 7 · 4 since 2021Theory of computation · 2 · 1 since 2021

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 protocols and secure computation · 64% Cryptographic primitives and cryptanalysis · 36%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › provable security › security notions › non-malleability
non-malleable codes
1.132022
Rate one-third non-malleable codes · STOC 2022
Four-State Non-malleable Codes with Explicit Constant Rate · J. Cryptol. 2020
Non-malleable Randomness Encoders and Their Applications · EUROCRYPT (3) 2018
Cryptographic primitives and cryptanalysis
randomness extraction
0.822021
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing · CRYPTO (3) 2021
Non-malleable Randomness Encoders and Their Applications · EUROCRYPT (3) 2018
Cryptographic protocols and secure computation › secret sharing
leakage-resilient secret sharing
0.722022
Short Leakage Resilient and Non-malleable Secret Sharing Schemes · CRYPTO (1) 2022
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing · CRYPTO (3) 2021
Cryptographic protocols and secure computation
secret sharing
0.722022
Short Leakage Resilient and Non-malleable Secret Sharing Schemes · CRYPTO (1) 2022
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing · CRYPTO (3) 2021
Cryptographic protocols and secure computation › malicious security
malicious client security
0.612022
SIMC: ML Inference Secure Against Malicious Clients at Semi-Honest Cost · USENIX Security Symposium 2022
Cryptographic protocols and secure computation › secret sharing
non-malleable secret sharing
0.612022
Short Leakage Resilient and Non-malleable Secret Sharing Schemes · CRYPTO (1) 2022
Cryptographic protocols and secure computation
secure inference
0.612022
SIMC: ML Inference Secure Against Malicious Clients at Semi-Honest Cost · USENIX Security Symposium 2022
Cryptographic primitives and cryptanalysis › provable security › security notions › non-malleability › non-malleable codes
split-state model
0.612022
Rate one-third non-malleable codes · STOC 2022
Cryptographic protocols and secure computation › private set intersection
circuit-PSI
0.512021
Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI · CCS 2021
Cryptographic protocols and secure computation › private set intersection
multi-party private set intersection
0.512021
Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI · CCS 2021
Cryptographic protocols and secure computation
private set intersection
0.512021
Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI · CCS 2021
Cryptographic primitives and cryptanalysis
coding theory
0.112020
Four-State Non-malleable Codes with Explicit Constant Rate · J. Cryptol. 2020

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

oblivious transfer · 0.5hashing · 0.5combinatorial construction · 0.4
YearPublicationVenuePosition
2022 Short Leakage Resilient and Non-malleable Secret Sharing Schemes
Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
CRYPTO (1)3
2022 Rate one-third non-malleable codes
abstract
At ITCS 2010, Dziembowski, Pietrzak, and Wichs introduced Non-malleable Codes (NMCs) which protect against tampering of a codeword of a given message into the codeword of a related message. A well-studied model of tampering is the 2-split-state model where the codeword consists of two independently tamperable states. As with standard error-correcting codes, it is of great importance to build codes with high rates.
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
STOC3
2022 SIMC: ML Inference Secure Against Malicious Clients at Semi-Honest Cost
Nishanth Chandran, Divya Gupta 0001, Sai Lakshmi Bhavana Obbattu, Akash Shah
USENIX Security Symposium3
2021 Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI
abstract
Multiparty Private Set Intersection (mPSI), enables n parties, each holding private sets (each of size m) to securely compute the intersection of these private sets. While several protocols are known for this task, the only concretely efficient protocol is due to the work of Kolesnikov et al. (KMPRT, CCS 2017), who gave a semi-honest secure protocol with communication complexity O(nmtƛ), where t < n is the number of corrupt parties and ƛ is the security parameter. In this work, we make the following contributions:
Nishanth Chandran, Nishka Dasgupta, Divya Gupta 0001, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, Akash Shah
CCS4
2021 Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing
Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
CRYPTO (3)3
2020 Four-State Non-malleable Codes with Explicit Constant Rate
Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
J. Cryptol.2
2018 Non-malleable Randomness Encoders and Their Applications
Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
EUROCRYPT (3)2
2017 Four-State Non-malleable Codes with Explicit Constant Rate
Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
TCC (2)2