Theory of Cryptography

DOI10.1007/b106171zbMath1079.94551OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711669

Dominique Unruh, Dennis Hofheinz

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106171

zbMATH Keywords

Reactive simulatability, universal simulatability, protocol composition

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ Polynomial runtime and composability ⋮ The IITM model: a simple and expressive model for universal composability ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Everlasting multi-party computation ⋮ On the relationships between notions of simulation-based security

This page was built for publication: Theory of Cryptography