scientific article; zbMATH DE number 1942434

zbMath1026.94539MaRDI QIDQ4409132

Jesper Buus Nielsen

Publication date: 30 June 2003

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

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

zbMATH Keywords

random oraclesByzantine agreement protocolthreshold pseudorandom function

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (8)

Adaptively secure distributed PRFs from LWE ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ McCulloch-Pitts Brains and Pseudorandom Functions ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ On selective-opening security of deterministic primitives

This page was built for publication: