Succinct non-interactive secure computation

DOI10.1007/978-3-030-45724-2_8MaRDI QIDQ2119013zbMATH OpenOpenAlexFDO

Authors Andrew Morgan, Rafael Pass, Antigoni Polychroniadou

Publication date 23 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-45724-2_8

Mathematics Subject Classification ID

Computer system organization (68Mxx) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Concurrently composable non-interactive secure computation
• Reusable non-interactive secure computation
• mrNISC from LWE with polynomial modulus
• Non-interactive secure computation from one-way functions
• Maliciously-secure MrNISC in the plain model

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Framework for Efficient and Composable Oblivious Transfer
• Advances in Cryptology – CRYPTO 2004
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Definitions and properties of zero-knowledge proof systems
• Efficient non-interactive secure computation
• Efficient oblivious transfer protocols
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• Laconic oblivious transfer and its applications
• Limits of extractability assumptions with distributional auxiliary input
• New notions of security: achieving universal composability without trusted setup
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Non-interactive secure 2PC in the offline/online and batch settings
• Non-interactive secure computation based on cut-and-choose
• Non-interactive secure computation from one-way functions
• On lattices, learning with errors, random linear codes, and cryptography
• On the existence of extractable one-way functions
• Probabilistic encryption
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Reusable garbled circuits and succinct functional encryption
• Round optimal blind signatures
• Short pairing-based non-interactive zero-knowledge arguments
• Smooth projective hashing and two-message oblivious transfer
• Succinct non-interactive arguments via linear interactive proofs
• The Exact Round Complexity of Secure Computation
• 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
• Witness encryption and its applications

Cited in

(11)

• Non-interactive secure computation from one-way functions
• Round-optimal black-box commit-and-prove with succinct communication
• Round-optimal and communication-efficient multiparty computation
• Reusable non-interactive secure computation
• Secure quantum computation with classical communication
• Two-round maliciously secure computation with super-polynomial simulation
• Maliciously-secure MrNISC in the plain model
• Concurrently composable non-interactive secure computation
• Authenticated BitGC for actively secure rate-one 2PC
• Black-box constant-round secure 2PC with succinct communication
• On succinct non-interactive secure computation with malicious security

This page was built for publication: Succinct non-interactive secure computation

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