Lightweight zero-knowledge proofs for crypto-computing protocols

DOI10.1007/978-3-319-13257-0_9MaRDI QIDQ3449182zbMATH OpenOpenAlexFDO

Authors Sven Laur, Bingsheng Zhang

Publication date 3 November 2015

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-13257-0_9

zbMATH Keywords

homomorphic encryptionzero-knowledgeuniversal composabilitymulti-party computationconditional disclosure of secrets

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Recommendations

• Zero-knowledge proofs from secure multiparty computation
• Compact zero-knowledge proofs of small Hamming weight
• New techniques for noninteractive zero-knowledge
• On the amortized complexity of zero-knowledge protocols
• Scalable zero knowledge via cycles of elliptic curves

Cited in

(1)

• scientific article; zbMATH DE number 1189383 (Why is no real title available?)

This page was built for publication: Lightweight zero-knowledge proofs for crypto-computing protocols

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