Pages that link to "Item:Q2931375"
From MaRDI portal
The following pages link to Information-theoretically secure protocols and security under composition (Q2931375):
Displayed 15 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Secure computation without computers (Q517015) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time (Q6061361) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Asymptotically free broadcast in constant expected time via packed VSS (Q6114239) (← links)
- Random sources in private computation (Q6135406) (← links)