scientific article; zbMATH DE number 1952886

zbMath1022.68547MaRDI QIDQ4414265

Ueli M. Maurer

Publication date: 24 July 2003

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

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

zbMATH Keywords

secret-sharingverifiable secret-sharingadversary structuresSecure multi-party computation

Mathematics Subject Classification ID

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

Related Items (12)

Broadcast from Minicast Secure Against General Adversaries ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ On the (in)efficiency of non-interactive secure multiparty computation ⋮ CNF-FSS and Its Applications ⋮ Secure Protocols with Asymmetric Trust ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Secure multi-party computation made simple ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ Random probing security: verification, composition, expansion and new constructions

This page was built for publication: