Succinct non-interactive secure computation

DOI10.1007/978-3-030-45724-2_8OpenAlexW3022866909MaRDI QIDQ2119013

Andrew Morgan, Antigoni Polychroniadou, Rafael Pass

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

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

Related Items (5)

Round-optimal and communication-efficient multiparty computation ⋮ Concurrently composable non-interactive secure computation ⋮ Secure quantum computation with classical communication ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Round-optimal black-box commit-and-prove with succinct communication

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Probabilistic encryption
• Definitions and properties of zero-knowledge proof systems
• Two-message statistically sender-private OT from LWE
• Laconic oblivious transfer and its applications
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Non-interactive secure computation from one-way functions
• Limits of Extractability Assumptions with Distributional Auxiliary Input
• (Leveled) fully homomorphic encryption without bootstrapping
• Efficient Non-interactive Secure Computation
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Founding Cryptography on Tamper-Proof Hardware Tokens
• New notions of security
• A Framework for Efficient and Composable Oblivious Transfer
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Fully homomorphic encryption using ideal lattices
• Round Optimal Blind Signatures
• On the existence of extractable one-way functions
• Non-interactive Secure 2PC in the Offline/Online and Batch Settings
• Advances in Cryptology – CRYPTO 2004
• Non-Interactive Secure Computation Based on Cut-and-Choose
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• Witness encryption and its applications
• Reusable garbled circuits and succinct functional encryption
• The Exact Round Complexity of Secure Computation
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

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