Pages that link to "Item:Q5451036"
From MaRDI portal
The following pages link to Secure Computation Without Authentication (Q5451036):
Displaying 17 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Structure-Preserving Smooth Projective Hashing (Q2953782) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- Contributory Password-Authenticated Group Key Exchange with Join Capability (Q3073704) (← links)
- UC-secure and Contributory Password-Authenticated Group Key Exchange (Q3179480) (← links)
- Collusion-Free Protocols in the Mediated Model (Q3600237) (← links)
- Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness (Q3637144) (← links)
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages (Q4916015) (← links)
- Analysis of the Blockchain Protocol in Asynchronous Networks (Q5267421) (← links)
- Removing Erasures with Explainable Hash Proof Systems (Q5738786) (← links)
- Generalized fuzzy password-authenticated key exchange from error correcting codes (Q6562582) (← links)