The following pages link to Emmanuela Orsini (Q557067):
Displaying 33 items.
- Correcting errors and erasures via the syndrome variety (Q557068) (← links)
- Improved decoding of affine-variety codes (Q714109) (← links)
- BBQ: using AES in Picnic signatures (Q778970) (← links)
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption (Q785020) (← links)
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Banquet: short and fast signatures from AES (Q2061922) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts (Q2167708) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- A Unified Approach to MPC with Preprocessing Using OT (Q2811152) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Between a Rock and a Hard Place: Interpolating between MPC and FHE (Q2867155) (← links)
- Dishonest Majority Multi-Party Computation for Binary Circuits (Q2874555) (← links)
- Bootstrapping BGV Ciphertexts with a Wider Choice of $$p$$ and $$q$$ (Q2941215) (← links)
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection (Q2975818) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Actively Secure OT Extension with Optimal Overhead (Q3457136) (← links)
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula> (Q3548088) (← links)
- COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES (Q3562516) (← links)
- An Introduction to Linear and Cyclic Codes (Q3652811) (← links)
- Decoding Cyclic Codes: the Cooper Philosophy (Q3652812) (← links)
- Gröbner Bases for the Distance Distribution of Systematic Codes (Q3652830) (← links)
- On the Shape of the General Error Locator Polynomial for Cyclic Codes (Q4682973) (← links)
- Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy (Q5504569) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5896075) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)
- MPC with delayed parties over star-like networks (Q6595681) (← links)
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\) (Q6595940) (← links)
- Black-box (and fast) non-malleable zero knowledge (Q6653055) (← links)
