scientific article; zbMATH DE number 1962807

zbMath1035.68502MaRDI QIDQ4418642

Maciej Liśkiewicz, Andreas Jakoby, K. Ruediger Reischuk

Publication date: 11 August 2003

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (7)

Oblivious transfer in incomplete networks ⋮ Communications in unknown networks: preserving the secret of topology ⋮ Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Random sources in private computation ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ On private computation in incomplete networks ⋮ A one-round secure message broadcasting protocol through a key sharing tree

This page was built for publication: