scientific article; zbMATH DE number 1759657

MaRDI QIDQ4536655zbMATH OpenFDO

Authors Clemente Galdi, P. Persiano

Publication date 23 November 2002

zbMATH Keywords

private function evaluationbroadcast channelprivate computationshared randomnesssecure distributed protocols

Mathematics Subject Classification ID

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

Recommendations

• Randomness complexity of private computation
• Lower and upper bounds on the randomness complexity of private computations of AND
• On the number of random bits in totally private computation
• Randomness in Private Computations
• Random sources in private computation

Cited in

(5)

• scientific article; zbMATH DE number 1421003 (Why is no real title available?)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• On the number of random bits in totally private computation
• Secret sharing schemes with partial broadcast channels
• Randomness complexity of private computation

This page was built for publication:

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