Computing Functions of a Shared Secret

DOI10.1137/S0895480195288819MaRDI QIDQ4490789zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Eyal Kushilevitz, M. V. D. Burmester, Yvo Desmedt

Publication date 20 July 2000

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480195288819

zbMATH Keywords

interactionsecret sharingbroadcast channelprivate channelsprivate computations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Theory of computing (68Q99)

Cited in

(11)

• scientific article; zbMATH DE number 1962157 (Why is no real title available?)
• Cutting-edge cryptography through the lens of secret sharing
• Cutting-edge cryptography through the lens of secret sharing
• Secure computation with preprocessing via function secret sharing
• Multi-recipient and threshold encryption based on hidden multipliers
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
• Performing computations on hierarchically shared secrets
• How to share a function securely
• Shared generation of pseudo-random functions
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Theory of Cryptography

This page was built for publication: Computing Functions of a Shared Secret

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