A second note on the feasibility of generalized universal composability
From MaRDI portal
Recommendations
- A note on the feasibility of generalised universal composability
- A Note on the Feasibility of Generalized Universal Composability
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- GNUC: a new universal composability framework
- General composition and universal composability in secure multiparty computation
Cites work
- A note on the feasibility of generalised universal composability
- A Note on the Feasibility of Generalized Universal Composability
- A note on universal composable zero-knowledge in the common reference string model
- Advances in Cryptology - CRYPTO 2003
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- On the limitations of universally composable two-party computation without set-up assumptions
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
Cited in
(6)- A note on universal composable zero-knowledge in the common reference string model
- GNUC: a new universal composability framework
- A note on the feasibility of generalised universal composability
- A Note on Universal Composable Zero Knowledge in Common Reference String Model
- A Note on the Feasibility of Generalized Universal Composability
- Security in Communication Networks
This page was built for publication: A second note on the feasibility of generalized universal composability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130297)
