Randomness in Private Sequential Stateless Protocols

This publication has 22 references indexed in Scilit:

• Randomness Requirements for Three-Secret Sharing
  2023
• Tight Bounds on the Randomness Complexity of Secure Multiparty Computation
  2022
• Random Sources in Private Computation
  2022
• Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
  2019
• Efficient Non-interactive Secure Computation
  2011
• Low-randomness constant-round private XOR computations
  International Journal of Information Security, 2006
• Private Computations in Networks: Topology versus Randomness
  Lecture Notes in Computer Science, 2003
• A Randomness-Rounds Tradeoff in Private Computation
  2001
• Randomness complexity of private computation
  computational complexity, 1999
• On colouring the nodes of a network
  Mathematical Proceedings of the Cambridge Philosophical Society, 1941