Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Orsini, Emmanuela
48  Ergebnisse:
Personensuche X
?
1

Simple Two-Message OT in the Explicit Isogeny Model:

Orsini, Emmanuela ; Zanotto, Riccardo
IACR Communications in Cryptology.  , 2024
Link: https://doi.org/10.62056..
 
?
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

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for $$\ma..:

, In: Cryptography and Coding; Lecture Notes in Computer Science,
Braun, Lennart ; de Saint Guilhem, Cyprien Delpech ; Jadoul, Robin... - p. 137-157 , 2023
Link: https://doi.org/10.1007/..
 
?
4

MPC with Delayed Parties over Star-Like Networks:

, In: Advances in Cryptology – ASIACRYPT 2023; Lecture Notes in Computer Science,
Gama, Mariana ; Beni, Emad Heydari ; Orsini, Emmanuela.. - p. 172-203 , 2023
Link: https://doi.org/10.1007/..
 
?
5

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/..
 
?
6

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/..
 
?
7

Four-Round Black-Box Non-malleable Schemes from One-Way Per..:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Ciampi, Michele ; Orsini, Emmanuela ; Siniscalchi, Luisa - p. 300-329 , 2022
Link: https://doi.org/10.1007/..
 
?
8

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/..
 
?
9

Efficient Proof of RAM Programs from Any Public-Coin Zero-K..:

, In: Lecture Notes in Computer Science; Security and Cryptography for Networks,
Delpech de Saint Guilhem, Cyprien ; Orsini, Emmanuela ; Tanguy, Titouan. - p. 615-638 , 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

Compilation of Function Representations for Secure Computin..:

, In: Topics in Cryptology – CT-RSA 2021; Lecture Notes in Computer Science,
Baghery, Karim ; Guilhem, Cyprien Delpech de Saint ; Orsini, Emmanuela.. - p. 26-50 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Efficient, Actively Secure MPC with a Dishonest Majority: A..:

, In: Arithmetic of Finite Fields; Lecture Notes in Computer Science,
Orsini, Emmanuela - p. 42-71 , 2021
Link: https://doi.org/10.1007/..
 
?
13

Error Term Checking: Towards Chosen Ciphertext Security wit..:

, In: Proceedings of the 8th ACM on ASIA Public-Key Cryptography Workshop,
D'Anvers, Jan-Pieter ; Orsini, Emmanuela ; Vercauteren, Frederik - p. 3-12 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

Limbo: Efficient Zero-knowledge MPCitH-based Arguments:

, In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security,
Delpech de Saint Guilhem, Cyprien ; Orsini, Emmanuela ; Tanguy, Titouan - p. 3022-3036 , 2021
Link: https://dl.acm.org/doi/1..
 
?
15

High-Performance Multi-party Computation for Binary Circuit..:

Burra, Sai Sheshank ; Larraia, Enrique ; Nielsen, Jesper Buus...
Journal of Cryptology.  34 (2021)  3 - p. , 2021
Link: https://doi.org/10.1007/..
 
1-15