Resource-based corruptions and the combinatorics of hidden diversity

DOI10.1145/2422436.2422482zbMath1364.94537OpenAlexW2056782590MaRDI QIDQ2986890

Juan A. Garay, Aggelos Kiayias, Mordechai M. Yung, David S. Johnson

Publication date: 16 May 2017

Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2422436.2422482

zbMATH Keywords

combinatorial analysishardness amplificationsecure multi-party computationcost of corruptionexact hardness

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (4)

Indistinguishable Proofs of Work or Knowledge ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ The combinatorics of hidden diversity ⋮ Everybody's a target: scalability in public-key encryption

Cites Work

• Teachability in computational learning
• Measuring teachability using variants of the teaching dimension
• Teaching a smarter learner.
• Occam's razor
• Pseudorandom generators for space-bounded computation
• On the power of inductive inference from good examples
• A model of interactive teaching
• Learning from different teachers
• On the limits of efficient teachability
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• On the complexity of teaching
• On specifying Boolean functions by labelled examples
• Recent Developments in Algorithmic Teaching
• A theory of the learnable
• Teaching Randomized Learners
• Algorithmic Learning Theory
• A theory of goal-oriented communication
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource-based corruptions and the combinatorics of hidden diversity