Peter Scholl
Peter Scholl
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
Practical covertly secure MPC for dishonest majority–or: breaking the SPDZ limits
I Damgård, M Keller, E Larraia, V Pastro, P Scholl, NP Smart
European Symposium on Research in Computer Security, 1-18, 2013
3992013
MASCOT: faster malicious arithmetic secure computation with oblivious transfer
M Keller, E Orsini, P Scholl
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
2472016
Actively secure OT extension with optimal overhead
M Keller, E Orsini, P Scholl
Annual Cryptology Conference, 724-741, 2015
1402015
Efficient, oblivious data structures for MPC
M Keller, P Scholl
International Conference on the Theory and Application of Cryptology and …, 2014
1212014
An architecture for practical actively secure MPC with dishonest majority
M Keller, P Scholl, NP Smart
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
892013
SPD: Efficient MPC mod for Dishonest Majority
R Cramer, I Damgård, D Escudero, P Scholl, C Xing
Annual International Cryptology Conference, 769-798, 2018
842018
Low cost constant round MPC combining BMR and oblivious transfer
C Hazay, P Scholl, E Soria-Vazquez
Journal of Cryptology 33 (4), 1732-1786, 2020
662020
MPC-friendly symmetric key primitives
L Grassi, C Rechberger, D Rotaru, P Scholl, NP Smart
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
652016
Efficient pseudorandom correlation generators: Silent OT extension and more
E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Annual International Cryptology Conference, 489-518, 2019
562019
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
M Orrù, E Orsini, P Scholl
Cryptographers’ Track at the RSA Conference, 381-396, 2017
562017
New primitives for actively-secure MPC over rings with applications to private machine learning
I Damgård, D Escudero, T Frederiksen, M Keller, P Scholl, N Volgushev
2019 IEEE Symposium on Security and Privacy (SP), 1102-1120, 2019
542019
Efficient two-round OT extension and silent non-interactive secure computation
E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Rindal, P Scholl
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
472019
Improved key generation for Gentry’s fully homomorphic encryption scheme
P Scholl, NP Smart
IMA International Conference on Cryptography and Coding, 10-22, 2011
432011
A unified approach to MPC with preprocessing using OT
TK Frederiksen, M Keller, E Orsini, P Scholl
International Conference on the Theory and Application of Cryptology and …, 2015
402015
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
SS Burra, E Larraia, JB Nielsen, PS Nordholt, C Orlandi, E Orsini, P Scholl, ...
Journal of Cryptology 34 (3), 1-87, 2021
352021
Homomorphic secret sharing from lattices without FHE
E Boyle, L Kohl, P Scholl
Annual International Conference on the Theory and Applications of …, 2019
282019
Improved primitives for MPC over mixed arithmetic-binary circuits
D Escudero, S Ghosh, M Keller, R Rachuri, P Scholl
Annual International Cryptology Conference, 823-852, 2020
262020
Scale–mamba v1. 12: Documentation
A Aly, K Cong, D Cozzo, M Keller, E Orsini, D Rotaru, O Scherer, P Scholl, ...
242021
Faster secure multi-party computation of AES and DES using lookup tables
M Keller, E Orsini, D Rotaru, P Scholl, E Soria-Vazquez, S Vivek
International Conference on Applied Cryptography and Network Security, 229-249, 2017
232017
TinyKeys: a new approach to efficient multi-party computation
C Hazay, E Orsini, P Scholl, E Soria-Vazquez
Annual International Cryptology Conference, 3-33, 2018
192018
The system can't perform the operation now. Try again later.
Articles 1–20