The following pages link to Claudio Orlandi (Q826289):
Displayed 48 items.
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Revealing encryption for partial ordering (Q1744841) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- Combining private set intersection with secure two-party computation (Q1796812) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Stronger security and constructions of multi-designated verifier signatures (Q2119047) (← links)
- Stronger notions and a more efficient construction of threshold ring signatures (Q2146104) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
- Proofs of replicated storage without timing assumptions (Q2181856) (← links)
- Quisquis: a new design for anonymous cryptocurrencies (Q2181901) (← links)
- Sharing information with competitors (Q2292612) (← links)
- How To Bootstrap Anonymous Communication (Q2800582) (← links)
- Non-Interactive Verifiable Secret Sharing for Monotone Circuits (Q2814710) (← links)
- Hiding the Input-Size in Secure Two-Party Computation (Q2867168) (← links)
- A New Approach to Practical Active-Secure Two-Party Computation (Q2914295) (← links)
- Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security) (Q2922654) (← links)
- Publicly Auditable Secure Multi-Party Computation (Q2922659) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge (Q2948383) (← links)
- Semi-homomorphic Encryption and Multiparty Computation (Q3003382) (← links)
- On Invertible Sampling and Adaptive Security (Q3058673) (← links)
- Lower and Upper Bounds for Deniable Public-Key Encryption (Q3102181) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Access Control Encryption: Enforcing Information Flow with Cryptography (Q3181040) (← links)
- On the Necessary and Sufficient Assumptions for UC Computation (Q3408190) (← links)
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost (Q3582777) (← links)
- LEGO for Two-Party Secure Computation (Q3611777) (← links)
- On the Power of Correlated Randomness in Secure Computation (Q4910301) (← links)
- Calling Out Cheaters: Covert Security with Public Verifiability (Q4911615) (← links)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions (Q4924431) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Access Control Encryption for Equality, Comparison, and More (Q5738753) (← links)
- Statistical Concurrent Non-malleable Zero Knowledge (Q5746337) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
- (Q6059364) (← links)
- Witness-succinct universally-composable SNARKs (Q6061363) (← links)
- Structure-preserving compilers from new notions of obfuscations (Q6067384) (← links)
- On access control encryption without sanitization (Q6134819) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- Secure multiparty computation from threshold encryption based on class groups (Q6186606) (← links)
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions (Q6186607) (← links)