Demo Data from VLDB 2026 / reviewers in the wild / expert
Peter Sebastian Nordholt
dblp:53/10310
· DBLP profile ↗
7ranked-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 · 7 · 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
6 papers |
Cryptographic protocols and secure computation · 65% Cryptographic primitives and cryptanalysis · 35% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › secure multiparty computation
binary circuit MPC |
0.5 | 1 | 2021 | High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer · J. Cryptol. 2021 |
Cryptographic protocols and secure computation
oblivious transfer |
0.5 | 1 | 2021 | High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer · J. Cryptol. 2021 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.5 | 1 | 2021 | High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer · J. Cryptol. 2021 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.4 | 2 | 2016 | Signature Schemes Secure Against Hard-to-Invert Leakage · J. Cryptol. 2016 Signature Schemes Secure against Hard-to-Invert Leakage · ASIACRYPT 2012 |
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation |
0.3 | 2 | 2013 | MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions · EUROCRYPT 2013 A New Approach to Practical Active-Secure Two-Party Computation · CRYPTO 2012 |
Cryptographic primitives and cryptanalysis
leakage-resilient cryptography |
0.2 | 1 | 2016 | Signature Schemes Secure Against Hard-to-Invert Leakage · J. Cryptol. 2016 |
Cryptographic protocols and secure computation › secure multiparty computation
active security |
0.1 | 1 | 2012 | A New Approach to Practical Active-Secure Two-Party Computation · CRYPTO 2012 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › digital signature security
leakage-resilient signatures |
0.1 | 1 | 2012 | Signature Schemes Secure against Hard-to-Invert Leakage · ASIACRYPT 2012 |
Cryptographic primitives and cryptanalysis › encryption
deniable encryption |
0.1 | 1 | 2011 | Lower and Upper Bounds for Deniable Public-Key Encryption · ASIACRYPT 2011 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
0.1 | 1 | 2011 | Lower and Upper Bounds for Deniable Public-Key Encryption · ASIACRYPT 2011 |
Methods — techniques the papers use, named apart from their topics
oblivious transfer · 0.6selective failure attack analysis · 0.5MAC methodology · 0.5garbled circuits · 0.3cut-and-choose · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | High-Performance Multi-party Computation for Binary Circuits Based on Oblivious TransferabstractWe 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. | 4 |
| 2018 | Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification
Peter Sebastian Nordholt, Meilof Veeningen |
ACNS | 1 |
| 2016 | Signature Schemes Secure Against Hard-to-Invert Leakage
Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel |
J. Cryptol. | 4 |
| 2013 | MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi |
EUROCRYPT | 4 |
| 2012 | Signature Schemes Secure against Hard-to-Invert Leakage
Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel |
ASIACRYPT | 4 |
| 2012 | A New Approach to Practical Active-Secure Two-Party Computation
Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra |
CRYPTO | 2 |
| 2011 | Lower and Upper Bounds for Deniable Public-Key Encryption
Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi |
ASIACRYPT | 3 |