Cryptography from Planted Graphs: Security with Logarithmic-Size Messages

Keyphrases

• Message Size 100%
• Adversary 100%
• Public Information 100%
• Cryptography 100%
• Cryptographic Primitives 100%
• Share Size 100%
• Messaging Protocol 100%
• Logarithmic Size 100%
• Private Simultaneous Messages 100%
• Computational Security 100%
• Statistical Inference 50%
• Non-interactive 50%
• First Application 50%
• Information-theoretic Security 50%
• Log-log 50%
• 1-bit 50%
• Preprocessing Model 50%
• Statistical Complexity 50%
• Information Security 50%
• Secret Sharing Scheme 50%
• Complexity Theory 50%
• Access Structure 50%
• Threshold Secret Sharing Scheme 50%
• Forbidden Graph 50%
• Graph Access Structure 50%
• Distinguishing Advantage 50%
• Model Improving 50%
• Planted Clique 50%
• Common Knowledge 50%
• Clique Problem 50%
• Inference Theory 50%

Computer Science

• Cryptographic Primitive 100%
• secret sharing scheme 100%
• Protocol Message 100%
• information theoretic security 50%
• Common Knowledge 50%
• Access Structure 50%
• Arbitrary Access Structure 50%
• Interactive 50%