Finding collisions in interactive protocols - Tight lower bounds on the round and communication complexities of statistically hiding commitments

Keyphrases

• Tight Lower Bound 100%
• Communication Complexity 100%
• Round Complexity 100%
• Statistically Hiding Commitment 100%
• Interactive Protocol 100%
• Cryptographic Protocols 66%
• Oracle 33%
• Commitment Scheme 33%
• Berlin 33%
• Black-box Reductions 33%
• Oblivious Transfer 33%
• Foundations of Computer Science 33%
• Cryptology 33%
• Interactive Hashing 33%
• Trapdoor Permutations 33%
• Statistical Security 33%
• Collision Finding 33%
• Private Information Retrieval 33%
• One-way Permutation 33%
• Lecture Notes 33%
• Annual Symposium 33%

Computer Science

• Communication Complexity 100%
• Cryptographic Protocol 66%
• Hashing 33%
• Cryptology 33%
• Information Retrieval 33%
• Computer Science 33%

Mathematics

• Permutation 100%
• Black Box 50%
• Single Server 50%