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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Sai Sheshank Burra

dblp:12/10310 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Security and privacy · 2 · 1 first-author · 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
2 papers
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure multiparty computation
binary circuit MPC		 0.512021
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer · J. Cryptol. 2021
Cryptographic protocols and secure computation
oblivious transfer		 0.512021
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer · J. Cryptol. 2021
Cryptographic protocols and secure computation
secure multiparty computation		 0.512021
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer · J. Cryptol. 2021
Cryptographic protocols and secure computation › secure multiparty computation
active security		 0.112012
A New Approach to Practical Active-Secure Two-Party Computation · CRYPTO 2012
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation		 0.112012
A New Approach to Practical Active-Secure Two-Party Computation · CRYPTO 2012

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

oblivious transfer · 0.6selective failure attack analysis · 0.5MAC methodology · 0.5garbled circuits · 0.1
YearPublicationVenuePosition
2021 High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
abstract
We present a unified view of the two-party and multi-party computation protocols based on oblivious transfer first outlined in Nielsen et al. (CRYPTO 2012) and Larraia et al. (CRYPTO 2014). We present a number of modifications and improvements to these earlier presentations, as well as full proofs of the entire protocol. Improvements include a unified pre-processing and online MAC methodology, mechanisms to pass between different MAC variants and fixing a minor bug in the protocol of Larraia et al. in relation to a selective failure attack. It also fixes a minor bug in Nielsen et al. resulting from using Jensen’s inequality in the wrong direction in an analysis.
Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
 J. Cryptol.1
2012 A New Approach to Practical Active-Secure Two-Party Computation
Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra
 CRYPTO4