Pages that link to "Item:Q1976007"
From MaRDI portal
The following pages link to Security and composition of multiparty cryptographic protocols (Q1976007):
Displaying 50 items.
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Security of blind signatures under aborts and applications to adaptive oblivious transfer (Q3096954) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation (Q3457057) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Composable Security in the Bounded-Quantum-Storage Model (Q3519536) (← links)
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES (Q3534215) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Secure and efficient protocols for multiple interdependent issues negotiation (Q3561600) (← links)
- Secure Multiparty AES (Q3583564) (← links)
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation (Q3593116) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- (Q4517291) (← links)
- Compliant cryptologic protocols (Q4707237) (← links)
- Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption (Q4975186) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Bit-Slice Auction Circuit (Q5030176) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Resilient-optimal interactive consistency in constant time (Q5138494) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Multi-Party Protocols, Information Complexity and Privacy (Q5205794) (← links)
- (Q5435083) (← links)
- The Layered Games Framework for Specifications and Analysis of Security Protocols (Q5445502) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Efficient Fully-Simulatable Oblivious Transfer (Q5458932) (← links)
- Legally-Enforceable Fairness in Secure Two-Party Computation (Q5458936) (← links)
- Statistical Security Conditions for Two-Party Secure Function Evaluation (Q5502794) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710831) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712191) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (Q5738976) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)
- Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Fast secure two-party ECDSA signing (Q5918379) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← links)