Get started
Author

Bhavana Kanukurthi

Observed name: Kanukurthi, Bhavana
ORCID: 0000-0001-7519-4477
Observed ORCID: 0000-0001-7519-4477
OpenAlex ID: A5018694969
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets
2012 · Yevgeniy Dodis, Bhavana Kanukurthi, et al. · IEEE Transactions on Information Theory · 99
Key Agreement from Close Secrets over Unsecured Channels
2009 · Bhavana Kanukurthi, Leonid Reyzin · Lecture notes in computer science · 80
PDF
Cryptography with Tamperable and Leaky Memory
2011 · Yael Tauman Kalai, Bhavana Kanukurthi, et al. · Lecture notes in computer science · 73
Locally Updatable and Locally Decodable Codes
2014 · Nishanth Chandran, Bhavana Kanukurthi, et al. · Lecture notes in computer science · 39
PDF
Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
2014 · Prabhanjan Ananth, Nishanth Chandran, et al. · Lecture notes in computer science · 38
PDF
Privacy amplification with asymptotically optimal entropy loss
2010 · Nishanth Chandran, Bhavana Kanukurthi, et al. · ACM Symposium on Theory of Computing (STOC) · 37
An Improved Robust Fuzzy Extractor
2008 · Bhavana Kanukurthi, Leonid Reyzin · Lecture notes in computer science · 29
Four-State Non-malleable Codes with Explicit Constant Rate
2017 · Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, et al. · Lecture notes in computer science · 27
Information-Theoretic Local Non-malleable Codes and Their Applications
2015 · Nishanth Chandran, Bhavana Kanukurthi, et al. · Lecture notes in computer science · 26
PDF
Non-malleable Randomness Encoders and Their Applications
2018 · Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, et al. · Lecture notes in computer science · 24
Rate one-third non-malleable codes
2022 · Divesh Aggarwal, Bhavana Kanukurthi, et al. · ACM Symposium on Theory of Computing (STOC) · 15
PDF
Short Leakage Resilient and Non-malleable Secret Sharing Schemes
2022 · Nishanth Chandran, Bhavana Kanukurthi, et al. · Lecture notes in computer science · 12
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing
2021 · Nishanth Chandran, Bhavana Kanukurthi, et al. · Lecture notes in computer science · 7
Privacy Amplification from Non-malleable Codes
2019 · Eshan Chattopadhyay, Bhavana Kanukurthi, et al. · Lecture notes in computer science · 4
PDF
Four-State Non-malleable Codes with Explicit Constant Rate
2019 · Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, et al. · Journal of Cryptology · 3
Privacy amplification with asymptotically optimal entropy loss
2014 · Nishanth Chandran, Bhavana Kanukurthi, et al. · Journal of the ACM · 3
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
2010 · Yevgeniy Dodis, Bhavana Kanukurthi, et al. · 2
Secure Auctions in the Presence of Rational Adversaries
2022 · Chaya Ganesh, Bhavana Kanukurthi, et al. · ACM SIGSAC Conference on Computer and Communications Security (CCS) · 1
Non-malleable Randomness Encoders and their Applications.
2017 · Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, et al. · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · 1
Secure Fuzzy Deduplication: Definitions and Constructions
2025 · Anirban Chakrabarti, Shreyas Gupta, et al.
PDF
Secure Vickrey Auctions with Rational Parties
2024 · Chaya Ganesh, Shreyas Gupta, et al. · ACM SIGSAC Conference on Computer and Communications Security (CCS)
Locally Reconstructable Non-Malleable Secret Sharing
2021 · Kanukurthi, Bhavana, Obbattu, Sai Lakshmi Bhavana, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters
2021 · Divesh Aggarwal, Bhavana Kanukurthi, et al. · IACR Cryptology ePrint Archive
Constant Rate (Non-malleable) Secret Sharing Schemes Tolerating Joint Adaptive Leakage.
2020 · Nishanth Chandran, Bhavana Kanukurthi, et al. · IACR Cryptology ePrint Archive
Privacy Amplification with Asymptotically Optimal Entropy Loss.
2012 · Nishanth Chandran, Bhavana Kanukurthi, et al.
Works count: 30
Citation count: 520
H-index: 12
I10-index: 12
Year
Topic
Type