Concurrently composable security with shielded super-polynomial simulators

DOI10.1007/978-3-319-56620-7_13MaRDI QIDQ5738883zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Round optimal concurrent MPC via strong simulation
• A new approach to black-box concurrent secure computation
• Black-box constructions of composable protocols without set-up
• Concurrently secure computation in constant rounds
• A unified framework for concurrent security

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• A unified framework for concurrent security
• A unified framework for UC from only OT
• 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 2004
• Black-box constructions of composable protocols without set-up
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Concurrent composition of secure protocols in the timing model
• Concurrent secure computation with optimal query complexity
• Concurrently secure computation in constant rounds
• Constant-round black-box construction of composable multi-party computation protocol
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 2009949 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Impossibility results for universal composability in public-key models and with fixed inputs
• New notions of security: achieving universal composability without trusted setup
• Non-malleability amplification
• Nonmalleable Cryptography
• On adaptively secure protocols
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• On concurrently secure computation in the multiple ideal query model
• Password-authenticated session-key generation on the internet in the plain model
• Round-efficient black-box construction of composable multi-party computation
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Theory of Cryptography
• Unconditionally secure and universally composable commitments from physical assumptions
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation
• What Information Is Leaked under Concurrent Composition?

Cited in

(12)

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Overcoming impossibility results in composable security using interval-wise guarantees
• A unified and composable take on ratcheting
• Adaptive security of multi-party protocols, revisited
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• A new approach to efficient non-malleable zero-knowledge
• Improved black-box constructions of composable secure computation
• Universally composable SNARKs with transparent setup without programmable random oracle
• Round-efficient composable two-party quantum computation
• Almost-total puzzles and their applications
• Universally composable succinct vector commitments and applications
• On strong simulation and composable point obfuscation

This page was built for publication: Concurrently composable security with shielded super-polynomial simulators

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