Iterated random oracle: A universal approach for finding loss in security reduction

• Main Authors: GUO, Fuchun, SUSILO, Willy, MU, Yi, CHEN, Rongmao, LAI, Jianchang, YANG, Guomin
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: Finding loss; Indistinguishability security under computational assumptions; Random oracle; Databases and Information Systems; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/7363; https://ink.library.smu.edu.sg/context/sis_research/article/8366/viewcontent/Iterated_random_oracle.pdf
• Institution: Singapore Management University

The indistinguishability security of a public-key cryptosystem can be reduced to a computational hard assumption in the random oracle model, where the solution to a computational hard problem is hidden in one of the adversary’s queries to the random oracle. Usually, there is a finding loss in findin...