New notions of security: achieving universal composability without trusted setup

DOI10.1145/1007352.1007394MaRDI QIDQ3580997zbMATH OpenOpenAlexFDO

Authors Manoj Prabhakaran, Amit Sahai

Publication date 15 August 2010

Published in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1007352.1007394

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Security with Global Setup
• Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
• A unified framework for concurrent security
• Universal composability from essentially any trusted setup

Cited in

(41)

• Efficient non-malleable commitment schemes
• On the exact round complexity of self-composable two-party computation
• Efficient hybrid encryption from ID-based encryption
• Succinct non-interactive secure computation
• Universally Composable Security with Global Setup
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• What security can we achieve within 4 rounds?
• One-message zero knowledge and non-malleable commitments
• Efficient non-malleable commitment schemes
• Composable long-term security with rewinding
• A unified framework for concurrent security
• Theory of Cryptography
• Impossibility results for universal composability in public-key models and with fixed inputs
• Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
• Long-term security and universal composability
• What Security Can We Achieve Within 4 Rounds?
• Unbounded ABE via bilinear entropy expansion, revisited
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Multi-party Computation with an Unreliable Common Reference String
• On concurrent multi-party quantum 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
• The reactive simulatability (RSIM) framework for asynchronous systems
• R3PO: reach-restricted reactive program obfuscation and its applications
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Universal composability from essentially any trusted setup
• A unified and composable take on ratcheting
• Bringing people of different beliefs together to do UC
• A simpler variant of universally composable security for standard multiparty computation
• Concurrently composable security with shielded super-polynomial simulators
• A new approach to efficient non-malleable zero-knowledge
• Adaptive security of multi-party protocols, revisited
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• Two-round maliciously secure computation with super-polynomial simulation
• General composition and universal composability in secure multiparty computation
• Local Sequentiality Does Not Help for Concurrent Composition
• Conditional reactive simulatability
• Overcoming impossibility results in composable security using interval-wise guarantees
• Round-efficient black-box construction of composable multi-party computation

This page was built for publication: New notions of security: achieving universal composability without trusted setup

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