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

Vanishree Rao

dblp:22/9358 · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Security and privacy · 9Theory of computation · 5

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
3 papers
Cryptographic primitives and cryptanalysis · 55% Cryptographic protocols and secure computation · 45%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
group key agreement
0.212015
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation · ASIACRYPT (1) 2015
Cryptographic protocols and secure computation
key exchange
0.212015
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation · ASIACRYPT (1) 2015
Cryptographic protocols and secure computation › secure multiparty computation
adaptive security
0.212014
Adaptive Security of Constrained PRFs · ASIACRYPT (2) 2014
Cryptographic primitives and cryptanalysis › pseudorandom functions
constrained pseudorandom functions
0.212014
Adaptive Security of Constrained PRFs · ASIACRYPT (2) 2014
Cryptographic primitives and cryptanalysis
pseudorandom functions
0.212014
Adaptive Security of Constrained PRFs · ASIACRYPT (2) 2014
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures
0.112011
Round Optimal Blind Signatures · CRYPTO 2011
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.112011
Round Optimal Blind Signatures · CRYPTO 2011
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › blind signatures
round-optimal blind signatures
0.112011
Round Optimal Blind Signatures · CRYPTO 2011

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

indistinguishability obfuscation · 0.2
YearPublicationVenuePosition
2017 Achieving Differential Privacy in Secure Multiparty Data Aggregation Protocols on Star Networks
abstract
We consider the problem of privacy-preserving data aggregation in a star network topology, i.e., several untrusting participants connected to a single aggregator. We require that the participants do not discover each other's data, and the service provider remains oblivious to each participant's individual contribution. Furthermore, the final result is to be published in a differentially private manner, i.e., the result should not reveal the contribution of any single participant to a (possibly external) adversary who knows the contributions of all other participants. In other words, we require a secure multiparty computation protocol that also incorporates a differentially private mechanism. Previous solutions have resorted to caveats such as postulating a trusted dealer to distribute keys to the participants, or introducing additional entities to withhold the decryption key from the aggregator, or relaxing the star topology by allowing pairwise communication amongst the participants. In this paper, we show how to obtain a noisy (differentially private) aggregation result using Shamir secret sharing and additively homomorphic encryption without these mitigating assumptions. More importantly, while we assume semi-honest participants, we allow the aggregator to be stronger than semi-honest, specifically in the sense that he can try to reduce the noise in the differentially private result.
Vincent Bindschaedler, Shantanu Rane, Alejandro E. Brito, Vanishree Rao, Ersin Uzun
CODASPY4
2015 Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
Dakshita Khurana, Vanishree Rao, Amit Sahai
ASIACRYPT (1)2
2015 Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
Dana Dachman-Soled, Jonathan Katz, Vanishree Rao
TCC (2)3
2014 Adaptive Security of Constrained PRFs
Georg Fuchsbauer, Momchil Konstantinov, Krzysztof Pietrzak, Vanishree Rao
ASIACRYPT (2)4
2014 Statistical Concurrent Non-malleable Zero Knowledge
Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti
TCC3
2013 On the (In)security of Fischlin's Paradigm
Prabhanjan Vijendra Ananth, Raghav Bhaskar, Vipul Goyal, Vanishree Rao
TCC4
2013 Revisiting Lower and Upper Bounds for Selective Decommitments
Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti
TCC2
2011 Round Optimal Blind Signatures
Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh
CRYPTO2
2011 Correlated-Input Secure Hash Functions
Vipul Goyal, Adam O'Neill, Vanishree Rao
TCC3