Succinct line-point zero-knowledge arguments from homomorphic secret sharing

DOI10.1007/978-981-95-5116-3_19MaRDI QIDQ7232573zbMATH OpenFDO

Authors Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan, Mengmeng Zhou

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5116-3_19

zbMATH Keywords

line-point zero-knowledge proofvector oblivious linear evaluation-based zero-knowledge protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• 10-party sublinear secure computation from standard assumptions
• A unified framework for succinct garbling from homomorphic secret sharing
• Algebraic methods for interactive proof systems
• An algebraic framework for silent preprocessing with trustless setup and active security
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Breaking the circuit size barrier for secure computation under DDH
• Efficient pseudorandom correlation generators: silent OT extension and more
• Foundations of homomorphic secret sharing
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Homomorphic secret sharing from lattices without FHE
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 7706037 (Why is no real title available?)
• Interactive line-point zero-knowledge with sublinear communication and linear computation
• LaBRADOR: compact proofs for R1CS from Module-SIS
• Large message homomorphic secret sharing from DCR and applications
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• On the size of pairing-based non-interactive arguments
• One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
• Rate-1 arithmetic garbling from homomorphic secret sharing
• Rinocchio: SNARKs for ring arithmetic
• Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
• Sok: vector OLE-based zero-knowledge protocols
• Spooky Encryption and Its Applications
• Sublinear-communication secure multiparty computation does not require FHE
• Succinct homomorphic secret sharing
• Succinct non-interactive arguments via linear interactive proofs
• The Knowledge Complexity of Interactive Proof Systems
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

This page was built for publication: Succinct line-point zero-knowledge arguments from homomorphic secret sharing

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