A unified framework for concurrent security

DOI10.1145/1536414.1536441MaRDI QIDQ5172711zbMATH OpenOpenAlexFDO

Authors Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

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

zbMATH Keywords

secure multi-party computationuniversal composabilitynon-malleability

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Recommendations

• A Declarative Framework for Security: Secure Concurrent Constraint Programming
• New notions of security: achieving universal composability without trusted setup
• A framework for compositional verification of security protocols
• scientific article; zbMATH DE number 2104621
• New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
• Theory of Cryptography
• Universally composable security
• Compositional system security with interface-confined adversaries

Cited in

(32)

• On the exact round complexity of self-composable two-party computation
• On black-box complexity of universally composable security in the CRS model
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• An Algebraic Approach to Nonmalleability
• (Public) verifiability for composable protocols without adaptivity or zero-knowledge
• Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
• Concurrent non-malleable commitments (and more) in 3 rounds
• Simplified universal composability framework
• Impossibility results for universal composability in public-key models and with fixed inputs
• Long-term security and universal composability
• Cryptography using \texttt{CAPTCHA} puzzles
• Unbounded ABE via bilinear entropy expansion, revisited
• Round-efficient composable two-party quantum computation
• A unified framework for UC from only OT
• Improved black-box constructions of composable secure computation
• Constant round adaptively secure protocols in the tamper-proof hardware model
• Concurrently composable non-interactive secure computation
• Adaptive hardness and composable security in the plain model from standard assumptions
• Non-malleable commitments against quantum attacks
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• On the necessary and sufficient assumptions for UC computation
• New notions of security: achieving universal composability without trusted setup
• Theory of Cryptography
• A simpler variant of universally composable security for standard multiparty computation
• A unified approach to constructing black-box UC protocols in trusted setup models
• Concurrently composable security with shielded super-polynomial simulators
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• On constant-round concurrent non-malleable proof systems
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions

This page was built for publication: A unified framework for concurrent security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172711)