Secure multiplication of shared secrets in the exponent

DOI10.1016/J.IPL.2005.01.015MaRDI QIDQ1044710zbMATH OpenOpenAlexFDO

Authors Rosario Gennaro, Mario Di Raimondo

Publication date 18 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.01.015

zbMATH Keywords

distributed computingcryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Recommendations

• Efficient secure two-party exponentiation
• Perfectly-secure multiplication for any \(t < n/3\)
• Atomic Secure Multi-party Multiplication with Low Communication
• Efficient two-party exponentiation from quotient transfer
• On \(d\)-multiplicative secret sharing

Cites work

• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 1418292 (Why is no real title available?)
• How to share a secret
• Security and composition of multiparty cryptographic protocols

Cited in

(4)

• Efficient two-party exponentiation from quotient transfer
• Efficient secure two-party exponentiation
• Private multiplication over finite fields
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions

This page was built for publication: Secure multiplication of shared secrets in the exponent

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