A unified framework for concurrent security
From MaRDI portal
Publication:5172711
DOI10.1145/1536414.1536441zbMath1304.68017OpenAlexW2004895849MaRDI QIDQ5172711
Huijia Lin, Muthuramakrishnan Venkitasubramaniam, Rafael Pass
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536441
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Related Items
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Non-malleable commitments against quantum attacks ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Concurrently composable non-interactive secure computation ⋮ On constant-round concurrent non-malleable proof systems ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ An Algebraic Approach to Nonmalleability ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Cryptography Using Captcha Puzzles ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ On black-box complexity of universally composable security in the CRS model ⋮ On the Necessary and Sufficient Assumptions for UC Computation ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function
