Peter Scholl


✉ [firstname] [dot] [surname] @cs.au.dk

Home  •  Publications  •  Activities

More publication details are available at Google Scholar and dblp.

2019

  1. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
    Elette Boyle and Geoffroy Couteau and Niv Gilboa and Yuval Ishai and Lisa Kohl and Peter Scholl
    CRYPTO 2019
    (eprint)
  2. New Primitives for Actively-Secure MPC mod 2^k with Applications to Private Machine Learning
    Ivan Damgård and Daniel Escudero and Tore Kasper Frederiksen and Marcel Keller and Peter Scholl and Nikolaj Volgushev
    IEEE S&P 2019
  3. Homomorphic Secret Sharing from Lattices Without FHE
    Elette Boyle and Lisa Kohl and Peter Scholl
    EUROCRYPT 2019
    (eprint)

2018

  1. Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
    Carmit Hazay and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez
    ASIACRYPT 2018
    (eprint)
  2. SPDZ_2^k: Efficient MPC mod 2^k for Dishonest Majority
    Ronald Cramer and Ivan Damgård and Daniel Escudero and Peter Scholl and Chaoping Xing
    CRYPTO 2018
    (eprint)
  3. TinyKeys: A New Approach to Efficient Multi-Party Computation
    Carmit Hazay and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez
    CRYPTO 2018
    (eprint)
  4. Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs
    Peter Scholl
    PKC 2018
    (eprint)
  5. Compact Zero-Knowledge Proofs of Small Hamming Weight
    Ivan Damgård and Ji Lao and Sabine Oechsner and Mark Simkin and Peter Scholl
    PKC 2018
    (eprint)

2017

  1. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
    Carmit Hazay and Peter Scholl and Eduardo Soria-Vazquez
    Asiacrypt 2017
    (eprint)
  2. When It’s All Just Too Much: Outsourcing MPC-Preprocessing
    Peter Scholl and Nigel P. Smart and Tim Wood
    IMA Cryptography & Coding 2017
    (eprint)
  3. Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables
    Marcel Keller and Emmanuela Orsini and Dragos Rotaru and Peter Scholl and Eduardo Soria-Vazquez and Srinivas Vivek
    ACNS 2017
    (eprint)
  4. Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
    Michele Orrù and Emmanuela Orsini and Peter Scholl
    CT-RSA 2017
    (eprint)

2016

  1. Efficient Secure Multiparty Computation with Identifiable Abort
    Carsten Baum and Emmanuela Orsini and Peter Scholl
    TCC 2016-b
    (eprint)
  2. MPC-Friendly Symmetric Key Primitives
    Lorenzo Grassi and Christian Rechberger and Dragos Rotaru and Peter Scholl and Nigel P. Smart
    ACM CCS 2016
    (eprint)
  3. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
    Marcel Keller and Emmanuela Orsini and Peter Scholl
    ACM CCS 2016
    (eprint)

2015

  1. A Unified Approach to MPC with Preprocessing using OT
    Tore Kasper Frederiksen and Marcel Keller and Emmanuela Orsini and Peter Scholl
    Asiacrypt 2015
    (eprint)
  2. Actively Secure OT Extension with Optimal Overhead
    Emmanuela Orsini and Marcel Keller and Peter Scholl
    CRYPTO 2015
    (eprint)

2014

  1. Efficient, Oblivious Data Structures for MPC
    Marcel Keller and Peter Scholl
    Asiacrypt 2014
    (eprint)

2013

  1. An architecture for practical actively secure MPC with dishonest majority
    Marcel Keller and Peter Scholl and Nigel P. Smart
    ACM CCS 2013
    (eprint)
  2. Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits
    Ivan Damgård and Marcel Keller and Enrique Larraia and Valerio Pastro and Peter Scholl and Nigel P. Smart
    ESORICS 2013 (Best Paper Award)
    (eprint | slides)

2011

  1. Improved Key Generation For Gentry's Fully Homomorphic Encryption Scheme
    Peter Scholl and Nigel P. Smart
    IMA Cryptography & Coding 2011
    (eprint | slides)