Follow
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
Computer Security–ESORICS 2013: 18th European Symposium on Research in …, 2013
6462013
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
5202016
Efficient pseudorandom correlation generators: Silent OT extension and more
E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
2582019
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
2512018
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
2292019
Actively secure OT extension with optimal overhead
M Keller, E Orsini, P Scholl
Annual Cryptology Conference, 724-741, 2015
2182015
Efficient, oblivious data structures for MPC
M Keller, P Scholl
Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014
1782014
Improved primitives for MPC over mixed arithmetic-binary circuits
D Escudero, S Ghosh, M Keller, R Rachuri, P Scholl
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
1742020
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
1732019
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
1322020
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
1302016
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
M Orrù, E Orsini, P Scholl
Topics in Cryptology–CT-RSA 2017: The Cryptographers’ Track at the RSA …, 2017
1212017
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
1192013
: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
C Baum, AJ Malozemoff, MB Rosen, P Scholl
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
1162021
Efficient pseudorandom correlation generators from ring-LPN
E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
942020
Homomorphic secret sharing from lattices without FHE
E Boyle, L Kohl, P Scholl
Annual International Conference on the Theory and Applications of …, 2019
762019
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
762015
The rise of paillier: Homomorphic secret sharing and public-key silent OT
C Orlandi, P Scholl, S Yakoubov
Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021
702021
Correlated pseudorandom functions from variable-density LPN
E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
682020
Banquet: short and fast signatures from AES
C Baum, CD de Saint Guilhem, D Kales, E Orsini, P Scholl, G Zaverucha
IACR International Conference on Public-Key Cryptography, 266-297, 2021
622021
The system can't perform the operation now. Try again later.
Articles 1–20