scientific article; zbMATH DE number 1952911

MaRDI QIDQ4414293zbMATH OpenFDO

Authors

Publication date 24 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2576/25760342.htm

zbMATH Keywords

secure multiparty computationgeneralized adversaries

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1583776
• Round Efficient Unconditionally Secure Multiparty Computation Protocol
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Scalable and Unconditionally Secure Multiparty Computation
• scientific article; zbMATH DE number 1842487

Cited in

(2)

• Efficient asynchronous verifiable secret sharing and multiparty computation
• Secure message transmission in asynchronous networks

This page was built for publication:

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