Theory of Cryptography
From MaRDI portal
Publication:5901780
DOI10.1007/b95566zbMath1197.94173OpenAlexW2498336418MaRDI QIDQ5901780
Michael Backes, Michael Waidner, Birgit Pfitzmann
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95566
Related Items
MoSS: modular security specifications framework ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Switched PIOA: parallel composition via distributed scheduling ⋮ Polynomial runtime and composability ⋮ Composable and finite computational security of quantum message transmission ⋮ Compact and Efficient UC Commitments Under Atomic-Exchanges ⋮ Universally Composable Firewall Architectures Using Trusted Hardware ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ State separation for code-based game-playing proofs ⋮ Resource fairness and composability of cryptographic protocols ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ On the (im-)possibility of extending coin toss ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ On the (Im-)Possibility of Extending Coin Toss ⋮ The Layered Games Framework for Specifications and Analysis of Security Protocols ⋮ GNUC: a new universal composability framework ⋮ Analyzing security protocols using time-bounded task-PIOAs ⋮ On the relationships between notions of simulation-based security ⋮ Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library ⋮ Conditional Reactive Simulatability ⋮ Quantifying Probabilistic Information Flow in Computational Reactive Systems ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles
