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

DOI10.1007/978-3-030-90459-3_25MaRDI QIDQ2695656zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)