Pages that link to "Item:Q3581307"
From MaRDI portal
The following pages link to Bounded-concurrent secure two-party computation without setup assumptions (Q3581307):
Displayed 18 items.
- Secure computation without authentication (Q656923) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions (Q2827730) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Equivocal Blind Signatures and Adaptive UC-Security (Q5445514) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- Efficient Round-Optimal Blind Signatures in the Standard Model (Q5854440) (← links)
- A universally composable non-interactive aggregate cash system (Q6135420) (← links)
- On concurrent multi-party quantum computation (Q6190133) (← links)