Explore a comprehensive talk from Asiacrypt 2016 on the Iterated Random Oracle approach for finding loss in security reduction. Delve into two types of security reductions, focusing on IND security based on computational hard problems. Examine the core of encryption reduction in random oracles and learn about traditional approaches like the Trapdoor Test in Cash-Kiltz-Shoup. Discover the concept of Iterated Random Oracle, its query process, and challenge queries. Compare three theories and understand queries through tree representation. Gain insights into the proof of the presented theory and its applications in cryptography.
Iterated Random Oracle - A Universal Approach for Finding Loss in Security Reduction
Overview
Syllabus
Intro
About this work
Two Types of Security Reductions
IND-Computational Hard Problem IND security based on a computational hard problem (IND-CHP) ???
Core of Encryption Reduction in Random Oracles Considering the following ciphertext
Finding Loss
Security Reduction in IND-CHP
Traditional Approach)
Trapdoor Test in Cash-Kiltz-Shoup Approach
Cash-Kiltz-Shoup)
What is Iterated Random Oracle? Suppose the adversary needs to make a challenge query in order to use
Iterated Query in the Iterated Random Oracle
Challenge Query in Iterated Random Oracle
Iterated Random Oracle)
Comparison of Three Theories
Queries and Tree Representation All queries and responses are represented using a tree.
Properties of Tree Representation
Proof of Our Theory
Conclusion
Theories in Applications
Taught by
TheIACR
