Concurrently Composable Security with Shielded Super-Polynomial Simulators

DOI10.1007/978-3-319-56620-7_13zbMath1411.94051OpenAlexW2614067309MaRDI QIDQ5738883

No author found.

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ A unified and composable take on ratcheting ⋮ 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 ⋮ Overcoming impossibility results in composable security using interval-wise guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Impossibility results for universal composability in public-key models and with fixed inputs
• Concurrent composition of secure protocols in the timing model
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• What Information Is Leaked under Concurrent Composition?
• Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
• Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
• Round-Efficient Black-Box Construction of Composable Multi-Party Computation
• Concurrently Secure Computation in Constant Rounds
• Black-Box Constructions of Composable Protocols without Set-Up
• On Adaptively Secure Protocols
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Concurrent Secure Computation with Optimal Query Complexity
• Universally composable two-party and multi-party secure computation
• New notions of security
• Password-Authenticated Session-Key Generation on the Internet in the Plain Model
• Universally Composable Security with Global Setup
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Nonmalleable Cryptography
• A Unified Framework for UC from Only OT
• On Concurrently Secure Computation in the Multiple Ideal Query Model
• A unified framework for concurrent security
• Non-malleability amplification
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Advances in Cryptology – CRYPTO 2004
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
• Theory of Cryptography

This page was built for publication: Concurrently Composable Security with Shielded Super-Polynomial Simulators