Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions

DOI10.1007/978-3-030-90459-3_25OpenAlexW3186194563MaRDI QIDQ2695656FDOQ2695656

Authors: Brandon Broadnax, Jeremias Mechler, Joern Mueller-Quade 

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_25

Recommendations

• Constant-round black-box construction of composable multi-party computation protocol
• Round-efficient black-box construction of composable multi-party computation
• Round-efficient black-box construction of composable multi-party computation
• Black-box constructions of composable protocols without set-up
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware

zbMATH Keywords

environmental friendlinessgame-based security properties of protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Distributed systems (68M14)

Cites Work

• Computational Complexity
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Founding Cryptography on Oblivious Transfer – Efficiently
• New and improved constructions of non-malleable cryptographic protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Universally composable two-party and multi-party secure computation
• New notions of security: achieving universal composability without trusted setup
• Concurrent general composition of secure protocols in the timing model
• Universally Composable Security with Global Setup
• Title not available (Why is that?)
• Title not available (Why is that?)
• A unified framework for concurrent security
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• Concurrently composable security with shielded super-polynomial simulators
• Non-malleability vs. CCA-security: the case of commitments
• Adaptive hardness and composable security in the plain model from standard assumptions
• Round-efficient black-box construction of composable multi-party computation
• Concurrently secure computation in constant rounds
• A new approach to black-box concurrent secure computation
• Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
• Publicly verifiable proofs of sequential work
• TARDIS: a foundation of time-lock puzzles in UC
• On the security of time-lock puzzles and timed commitments
• Unconditionally secure and universally composable commitments from physical assumptions
• On Black-Box Complexity of Universally Composable Security in the CRS Model

Cited In (1)

• Theory of Cryptography

This page was built for publication: Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions

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