A second note on the feasibility of generalized universal composability
From MaRDI portal
Publication:3130297
DOI10.1017/S0960129516000074zbMath1425.94061MaRDI QIDQ3130297
Alonso González, Alejandro Hevia
Publication date: 11 January 2018
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17) Network protocols (68M12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on universal composable zero-knowledge in the common reference string model
- On the limitations of universally composable two-party computation without set-up assumptions
- Universally composable two-party and multi-party secure computation
- Universally Composable Security with Global Setup
- A note on the feasibility of generalised universal composability
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- A Note on the Feasibility of Generalized Universal Composability
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: A second note on the feasibility of generalized universal composability
