Impossibility results for universal composability in public-key models and with fixed inputs
type: Item
instance of: scholarly article
title: Impossibility results for universal composability in public-key models and with fixed inputs
zbMATH Open document ID: 1258.94039
author: Dafna Kidron
author: Yehuda Lindell
published in: Journal of Cryptology
publication date: 2012-09-21T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6085142
MaRDI profile type: Publication
OpenAlex ID: W2154567403
cites work: Secure Computation Without Authentication
cites work: Q4035733
cites work: Security and composition of multiparty cryptographic protocols
cites work: Q4783717
cites work: Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
cites work: Resettable zero-knowledge (extended abstract)
cites work: Universally composable two-party and multi-party secure computation
cites work: On the limitations of universally composable two-party computation without set-up assumptions
cites work: On the Necessary and Sufficient Assumptions for UC Computation
cites work: Theory of Cryptography
cites work: Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
cites work: Foundations of Cryptography
cites work: Q4279565
cites work: Concurrent general composition of secure protocols in the timing model
cites work: Information-theoretically secure protocols and security under composition
cites work: A unified framework for concurrent security
cites work: Composition of secure multi-party protocols. A comprehensive study.
cites work: Q4434874
cites work: New notions of security
DOI: 10.1007/S00145-010-9069-7
description: scientific article; zbMATH DE number 6085142