Concurrently composable non-interactive secure computation
From MaRDI portal
Recommendations
Cites work
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A unified framework for concurrent security
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptive One-Way Functions and Applications
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrently secure computation in constant rounds
- Constant-round black-box construction of composable multi-party computation protocol
- Definitions and properties of zero-knowledge proof systems
- Foundations of Cryptography
- From selective to adaptive security in functional encryption
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (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 1775426 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- New notions of security: achieving universal composability without trusted setup
- On the exact round complexity of self-composable two-party computation
- One-message zero knowledge and non-malleable commitments
- Output-compressing randomized encodings and applications
- Round optimal blind signatures
- Round optimal concurrent MPC via strong simulation
- Round-efficient black-box construction of composable multi-party computation
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Security and composition of multiparty cryptographic protocols
- Succinct non-interactive secure computation
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of Cryptography
- Two-message statistically sender-private OT from LWE
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Two-round adaptively secure multiparty computation from standard assumptions
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Two-round multiparty secure computation from minimal assumptions
- Two-round oblivious transfer from CDH or LPN
- Universally Composable Security with Global Setup
- Witness encryption and its applications
Cited in
(8)- Succinct non-interactive secure computation
- Secure non-interactive simulation: feasibility and rate
- Reusable non-interactive secure computation
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Non-interactive secure computation based on cut-and-choose
- Black-box reusable NISC with random oracles
- Maliciously-secure MrNISC in the plain model
- mrNISC from LWE with polynomial modulus
This page was built for publication: Concurrently composable non-interactive secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135409)
