Weakened Random Oracle Models with Target Prefix

07/12/2021
by   Masayuki Tezuka, et al.
0

Weakened random oracle models (WROMs) are variants of the random oracle model (ROM). The WROMs have the random oracle and the additional oracle which breaks some property of a hash function. Analyzing the security of cryptographic schemes in WROMs, we can specify the property of a hash function on which the security of cryptographic schemes depends. Liskov (SAC 2006) proposed WROMs and later Numayama et al. (PKC 2008) formalized them as CT-ROM, SPT-ROM, and FPT-ROM. In each model, there is the additional oracle to break collision resistance, second preimage resistance, preimage resistance respectively. Tan and Wong (ACISP 2012) proposed the generalized FPT-ROM (GFPT-ROM) which intended to capture the chosen prefix collision attack suggested by Stevens et al. (EUROCRYPT 2007). In this paper, in order to analyze the security of cryptographic schemes more precisely, we formalize GFPT-ROM and propose additional three WROMs which capture the chosen prefix collision attack and its variants. In particular, we focus on signature schemes such as RSA-FDH, its variants, and DSA, in order to understand essential roles of WROMs in their security proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2022

Multi-signer Strong Designated Multi-verifier Signature Schemes based on Multiple Cryptographic Algorithms

A designated verifier signature scheme allows a signer to generate a sig...
research
02/23/2019

Quantum security of hash functions and property-preservation of iterated hashing

This work contains two major parts: comprehensively studying the securit...
research
05/30/2019

Proof-of-forgery for hash-based signatures

In the present work, a peculiar property of hash-based signatures allowi...
research
02/28/2022

Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM

Commit-and-open Sigma-protocols are a popular class of protocols for con...
research
07/23/2022

Bandwidth-Hard Functions from Random Permutations

ASIC hash engines are specifically optimized for parallel computations o...
research
03/03/2021

Revisiting the Concrete Security of Goldreich's Pseudorandom Generator

Local pseudorandom generators are a class of fundamental cryptographic p...
research
12/09/2019

No additional tournaments are quasirandom-forcing

A tournament H is quasirandom-forcing if the following holds for every s...

Please sign up or login with your details

Forgot password? Click here to reset