Randomness in private sequential stateless protocols

DOI10.1007/978-981-96-0941-3_2MaRDI QIDQ6965183zbMATH OpenFDO

Authors Hari Krishnan P. Anilkumar, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran

Publication date 3 July 2025

zbMATH Keywords

lower boundbranching programsrandomness complexityprivate computationprivate sequential stateless model

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1256773 (Why is no real title available?)
• scientific article; zbMATH DE number 1962807 (Why is no real title available?)
• scientific article; zbMATH DE number 1775399 (Why is no real title available?)
• scientific article; zbMATH DE number 1406796 (Why is no real title available?)
• scientific article; zbMATH DE number 7559107 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A minimal model for secure computation (extended abstract)
• Amortizing randomness in private multiparty computations
• Communication and Randomness Lower Bounds for Secure Computation
• Efficient non-interactive secure computation
• Lower and upper bounds on the randomness complexity of private computations of AND
• Lower bounds on the amount of randomness in private computation
• On the power of regular and permutation branching programs
• Pseudorandomness for network algorithms
• Random sources in private computation
• Randomness complexity of private computation
• Randomness in private computations
• Randomness versus fault-tolerance
• Tight bounds on the randomness complexity of secure multiparty computation

This page was built for publication: Randomness in private sequential stateless protocols

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