Peter Scholl
Artificial Intelligence · 2013–2019
A researcher in the Science corpus: 7 papers; trusts 38 researchers and is trusted by 29 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 92 citations into it; #6,085 of 35,345 by trust here, #8,439 by citations
- Computational Theory and Mathematics — 52 citations into it; #1,236 of 12,182 by trust here, #1,101 by citations
- Information Systems — 28 citations into it; #1,548 of 8,771 by trust here, #1,392 by citations
- Privacy & Security — 21 citations into it
- Electrical and Electronic Engineering — 16 citations into it
- Computer Networks and Communications — 15 citations into it
- Computer Vision and Pattern Recognition — 6 citations into it
Whom Peter Scholl trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ivan Bjerre Damgård
- Marcel Keller
- Jesper Buus Nielsen
- Craig Gentry
- Ran Canetti
- Marina Blanton
- Donald Beaver
- Nigel P. Smart
- Mehrdad Aliasgari
- Eike Kiltz
Who trusts Peter Scholl overall
- Marcel Keller
- Yehuda Lindell
- Adrià Gascón
- Daniel E. Escudero
- Assi Barak
- Ivan Bjerre Damgård
- Phillipp Schoppmann
- Xiao Shaun Wang
- Ronald Cramer
- Peeter Laud
Papers from Peter Scholl's perspective
Ordered by how strongly the researchers Peter Scholl trusts endorse each paper. Same corpus, a different order for every researcher.
- Fairplay - Secure Two-Party Computation System
- Secure Two-Party Computation is Practical
- Universally composable security: a new paradigm for cryptographic protocols
- Completeness theorems for non-cryptographic fault-tolerant distributed computation
- Learning Multiple Layers of Features from Tiny Images
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Secure Computation with Fixed-Point Numbers
- Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation
- Fair exchange with a semi-trusted third party (extended abstract)
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
Their papers
- Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits (2013) — 552 citations
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer (2016) — 497 citations
- Efficient, Oblivious Data Structures for MPC (2014) — 147 citations
- SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority (2018) — 192 citations
- New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning (2019) — 182 citations
- Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (2019) — 269 citations
- SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority (2018)