scientific article; zbMATH DE number 1842509

zbMath1003.94534MaRDI QIDQ4783743

Ronald Cramer, Serge Fehr, Ivan B. Damgård

Publication date: 8 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390503

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitymulti-party computationsecret reconstructionVSS schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (9)

Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Efficient robust secret sharing from expander graphs ⋮ Nearly optimal robust secret sharing ⋮ From fairness to full security in multiparty computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Secure Protocol Transformations ⋮ Nearly optimal robust secret sharing against rushing adversaries

This page was built for publication: