I agree that this site is using cookies. You can find further informations here.
X
Scholl, Peter
812  results:
Search for persons X
?
1

Succinct Homomorphic Secret Sharing:

, In: Lecture Notes in Computer Science; Advances in Cryptology – EUROCRYPT 2024,
Abram, Damiano ; Roy, Lawrence ; Scholl, Peter - p. 301-330 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Scooby: Improved multi-party homomorphic secret sharing bas..:

Chillotti, Ilaria ; Orsini, Emmanuela ; Scholl, Peter.
Information and Computation.  297 (2024)  - p. 105133 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatu..:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
Baum, Carsten ; Braun, Lennart ; de Saint Guilhem, Cyprien Delpech... - p. 581-615 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Simple Threshold (Fully Homomorphic) Encryption from LWE wi..:

, In: Advances in Cryptology – ASIACRYPT 2023; Lecture Notes in Computer Science,
Boudgoust, Katharina ; Scholl, Peter - p. 371-404 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Sok: vector OLE-based zero-knowledge protocols:

Baum, Carsten ; Dittmer, Samuel ; Scholl, Peter.
Designs, Codes and Cryptography.  91 (2023)  11 - p. 3527-3561 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Oblivious Transfer with Constant Computational Overhead:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
Boyle, Elette ; Couteau, Geoffroy ; Gilboa, Niv... - p. 271-302 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Correlated Pseudorandomness from Expand-Accumulate Codes:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
Boyle, Elette ; Couteau, Geoffroy ; Gilboa, Niv... - p. 603-633 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Moz$$\mathbb {Z}_{2^k}$$arella: Efficient Vector-OLE and Ze..:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
Baum, Carsten ; Braun, Lennart ; Munch-Hansen, Alexander. - p. 329-358 , 2022
Link: https://doi.org/10.1007/..
 
?
9

On the Bottleneck Complexity of MPC with Correlated Randomn..:

, In: Public-Key Cryptography – PKC 2022; Lecture Notes in Computer Science,
Orlandi, Claudio ; Ravi, Divya ; Scholl, Peter - p. 194-220 , 2022
Link: https://doi.org/10.1007/..
 
?
10

Feta : Efficient Threshold Designated-Verifier Zero-Know..:

, In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security,
Baum, Carsten ; Jadoul, Robin ; Orsini, Emmanuela.. - p. 293-306 , 2022
Link: https://dl.acm.org/doi/1..
 
?
11

An Algebraic Framework for Silent Preprocessing with Trustl..:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
Abram, Damiano ; Damgård, Ivan ; Orlandi, Claudio. - p. 421-452 , 2022
Link: https://doi.org/10.1007/..
 
?
12

Scooby: Improved Multi-party Homomorphic Secret Sharing Bas..:

, In: Lecture Notes in Computer Science; Security and Cryptography for Networks,
Chillotti, Ilaria ; Orsini, Emmanuela ; Scholl, Peter.. - p. 540-563 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation ..:

, In: 2022 IEEE Symposium on Security and Privacy (SP),
Abram, Damiano ; Nof, Ariel ; Orlandi, Claudio.. - p. 2554-2572 , 2022
Link: https://doi.org/10.1109/..
 
?
14

Le Mans: Dynamic and Fluid MPC for Dishonest Majority:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
Rachuri, Rahul ; Scholl, Peter - p. 719-749 , 2022
Link: https://doi.org/10.1007/..
 
?
15

TinyKeys: A New Approach to Efficient Multi-Party Computati..:

Hazay, Carmit ; Orsini, Emmanuela ; Scholl, Peter.
Journal of Cryptology.  35 (2022)  2 - p. , 2022
Link: https://doi.org/10.1007/..
 
1-15