103 results on '"Orsini, Emmanuela"'
Search Results
2. ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for
3. Scooby: Improved multi-party homomorphic secret sharing based on FHE
4. MPC with Delayed Parties over Star-Like Networks
5. Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head
6. Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head
7. Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
8. Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System
9. Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE
10. Simple Two-Message OT in the Explicit Isogeny Model
11. Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits
12. Compilation of Function Representations for Secure Computing Paradigms
13. Banquet: Short and Fast Signatures from AES
14. Efficient, Actively Secure MPC with a Dishonest Majority: A Survey
15. Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
16. Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
17. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
18. Overdrive2k: Efficient Secure MPC over from Somewhat Homomorphic Encryption
19. BBQ: Using AES in Picnic Signatures
20. TinyKeys: A New Approach to Efficient Multi-Party Computation
21. On the shape of the general error locator polynomial for cyclic codes
22. Compilation of Function Representations for Secure Computing Paradigms
23. Efficient, Actively Secure MPC with a Dishonest Majority: A Survey
24. Banquet: Short and Fast Signatures from AES
25. TinyKeys: A New Approach to Efficient Multi-Party Computation
26. Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
27. High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
28. Improved decoding of affine-variety codes
29. Computing the distance distribution of systematic non-linear codes
30. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
31. Overdrive2k: Efficient Secure MPC over $$\mathbb {Z}_{2^k}$$ from Somewhat Homomorphic Encryption
32. Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
33. Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts
34. Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
35. Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
36. Efficient Secure Multiparty Computation with Identifiable Abort
37. Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing
38. A Unified Approach to MPC with Preprocessing Using OT
39. Actively Secure OT Extension with Optimal Overhead
40. Bootstrapping BGV Ciphertexts with a Wider Choice of
41. Dishonest Majority Multi-Party Computation for Binary Circuits
42. Feta
43. Between a Rock and a Hard Place: Interpolating between MPC and FHE
44. Gröbner Bases for the Distance Distribution of Systematic Codes
45. Decoding Cyclic Codes: the Cooper Philosophy
46. An Introduction to Linear and Cyclic Codes
47. Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
48. Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
49. Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts
50. Improved decoding of affine-variety codes
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.