Pages that link to "Item:Q3457057"

The following pages link to A Simpler Variant of Universally Composable Security for Standard Multiparty Computation (Q3457057):

Displayed 19 items.

• High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) ‎ (← links)
• BETA: biometric-enabled threshold authentication (Q2061958) ‎ (← links)
• Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) ‎ (← links)
• Formalizing data deletion in the context of the right to be forgotten (Q2119018) ‎ (← links)
• The IITM model: a simple and expressive model for universal composability (Q2210435) ‎ (← links)
• Probabilistic termination and composability of cryptographic protocols (Q2318087) ‎ (← links)
• Cryptographic shallots: a formal treatment of repliable onion encryption (Q2697893) ‎ (← links)
• Simplified Universal Composability Framework (Q2796143) ‎ (← links)
• Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) ‎ (← links)
• Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) ‎ (← links)
• Adaptive Oblivious Transfer and Generalization (Q2953778) ‎ (← links)
• Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) ‎ (← links)
• More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) ‎ (← links)
• How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) ‎ (← links)
• TinyKeys: a new approach to efficient multi-party computation (Q5918657) ‎ (← links)
• Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) ‎ (← links)
• Supersingular curves you can trust (Q6061368) ‎ (← links)
• SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model (Q6155273) ‎ (← links)
• Completeness theorems for adaptively secure broadcast (Q6186585) ‎ (← links)