A threshold pseudorandom function construction and its applications

DOI10.1007/3-540-45708-9_26MaRDI QIDQ4409132zbMATH OpenFDO

Authors Jesper Buus Nielsen

Publication date 30 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Byzantine agreement protocolrandom oraclesthreshold pseudorandom function

Mathematics Subject Classification ID

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

Recommendations

• Theory of Cryptography
• Random oracles in constantipole
• Number-theoretic constructions of efficient pseudo-random functions
• Limits on the Usefulness of Random Oracles
• Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier

Cited in

(11)

• On expected constant-round protocols for Byzantine agreement
• Adaptively secure distributed PRFs from LWE
• Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
• On selective-opening security of deterministic primitives
• Asynchronous Multi-Party Computation with Quadratic Communication
• McCulloch-Pitts brains and pseudorandom functions
• Theory of Cryptography
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• Robust Distributed Pseudorandom Functions for mNP Access Structures
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• MATSE: amortized threshold symmetric-key encryption for matrices

This page was built for publication: A threshold pseudorandom function construction and its applications

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