New notions of security: achieving universal composability without trusted setup

DOI10.1145/1007352.1007394zbMATH Open1192.94124OpenAlexW2085140050MaRDI QIDQ3580997FDOQ3580997

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

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

Mathematics Subject Classification ID

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

Cited In (37)

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?
Efficient non-malleable commitment schemes
Composable long-term security with rewinding
One-message zero knowledge and non-malleable commitments
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
A unified framework for concurrent security
Theory of Cryptography
Impossibility results for universal composability in public-key models and with fixed inputs
What Security Can We Achieve Within 4 Rounds?
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Universally Composable Multi-party Computation with an Unreliable Common Reference String
Long-term security and universal composability
Unbounded ABE via bilinear entropy expansion, revisited
Concurrently Composable Security with Shielded Super-Polynomial Simulators
On concurrent multi-party quantum computation
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
Conditional Reactive Simulatability
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
A unified and composable take on ratcheting
On the Exact Round Complexity of Self-composable Two-Party Computation
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
Overcoming impossibility results in composable security using interval-wise guarantees
Efficient non-malleable commitment schemes
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)