An optimal distributed discrete log protocol with applications to homomorphic secret sharing

DOI10.1007/978-3-319-96878-0_8MaRDI QIDQ5896076zbMATHOpenAlexFDO

Authors Itai Dinur, Nathan Keller, Ohad Klein

Publication date 30 June 2020

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-96878-0_8

zbMATH Keywords

random walkfully homomorphic encryptiondiscrete logarithmhomomorphic secret sharingshare conversiondiscrete logarithm in a short interval

Mathematics Subject Classification ID

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

Recommendations

• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Breaking the circuit size barrier for secure computation under DDH
• Homomorphic secret sharing from Paillier encryption
• Foundations of homomorphic secret sharing
• Large message homomorphic secret sharing from DCR and applications

Cited in

(8)

• On homomorphic secret sharing from polynomial-modulus LWE
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Homomorphic secret sharing from Paillier encryption
• Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
• Large message homomorphic secret sharing from DCR and applications
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• On the distributed discrete logarithm problem with preprocessing
• Round-robin is optimal: lower bounds for group action based protocols

This page was built for publication: An optimal distributed discrete log protocol with applications to homomorphic secret sharing

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