Towards efficient private distributed computation on unbounded input streams (extended abstract)

Keyphrases

• Derandomization 50%
• Distributed Computation 100%
• Extended Abstracts 100%
• Extra Assumption 50%
• Finite Automata 100%
• Information-theoretic Security 50%
• Input Stream 100%
• Input Symbol 100%
• Memory Content 50%
• One-way Function 50%
• Polynomial Time 50%
• Pseudorandom number Generator 50%
• Randomized Methods 50%
• Secret Sharing 50%
• Security Parameters 50%
• Shared Inputs 50%
• Swarm Computing 50%
• Time Complexity 50%
• Time Computation 50%

Computer Science

• Distributed Computation 100%
• information theoretic security 50%
• Input Symbol 100%
• Input-Stream 100%
• Memory Content 50%
• Polynomial Time 50%
• Secret Sharing 50%
• Security Parameter 50%
• State Automaton 100%
• Time Complexity 50%

Mathematics

• Input Symbol 100%
• One-Way Function 50%
• Polynomial 50%
• Polynomial Time 50%
• Pseudo-Random Generator 50%