• No results found

random oracle

A  Note  on  the  Instantiability  of  the  Quantum  Random  Oracle

A Note on the Instantiability of the Quantum Random Oracle

... the random oracle model has been re-examined in the presence of quantum ...the random or- acle by a quantum ...quantum random oracle model ...quantum random oracle this ...

20

A  Security  Proof  of  KCDSA  using  an  extended  Random  Oracle  Model

A Security Proof of KCDSA using an extended Random Oracle Model

... the Random Oracle Model, which allows the cases where the Simulator doesn’t solve the discrete loga- rithm problem to be absorbed within low probability ...

10

Non-interactive  zero-knowledge  proofs  in  the  quantum  random  oracle  model

Non-interactive zero-knowledge proofs in the quantum random oracle model

... Our protocol. So both in Fiat-Shamir and in Fischlin’s scheme we face the challenge that it is difficult to get the query inputs made by the malicious prover. Nevertheless, in our construction we will still try to ...

26

Making  Groth's  zk-SNARK  Simulation  Extractable  in  the  Random  Oracle  Model

Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model

... In the regular soundness and simulation extractability definitions of a NILP, the adversary must choose his matrices and the resultant output as a function only of the public input x. We give a definition of a more ...

15

Generic  Authenticated  Key  Exchange  in  the  Quantum  Random  Oracle  Model

Generic Authenticated Key Exchange in the Quantum Random Oracle Model

... In our proof, we want to make use of the technique from [44] to simulate the decryption oracles by patching encryption into the random oracle H. In order to extend their technique to PKE schemes with ...

61

Adaptive  Proofs  have  Straightline  Extractors (in  the  Random  Oracle  Model)

Adaptive Proofs have Straightline Extractors (in the Random Oracle Model)

... group element x gives us a representation [d, 0] (i.e. independent of h ) then just return d as the witness. The rst time M outputs a valid proof with x represented as [α, β] for β 6= 0 , output the relevant (x, (a, s)) ...

29

Tighter  Security  Proofs  for  GPV-IBE  in  the  Quantum  Random  Oracle  Model

Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model

... the random oracle the same way for all identities and naturally fits the QROM setting where an adversary may query a superposition of all identities in one random oracle ...

38

Simulation-Based  Secure  Functional  Encryption  in  the  Random  Oracle  Model

Simulation-Based Secure Functional Encryption in the Random Oracle Model

... More recently, De Caro et al. [DIJ + 13] showed how to overcome all known impossibility results assuming the existence of IND-Secure schemes for circuits with random oracle gates. This is a very strong ...

34

On  the  Exact  Security  of  Schnorr-Type  Signatures  in  the  Random  Oracle  Model

On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model

... the random oracle, the corresponding answer was c (in other words, the forger never returns a forgery that it knows to be invalid: we assume it returns ⊥ in this ...the random oracle query ...

24

In  the  point  of  view  security,  An  efficient  scheme  in  IBE  with  random  oracle

In the point of view security, An efficient scheme in IBE with random oracle

... Franklin. In [8] the authors are based on [20] to project the hash in the ordinary curves instead of super singular, their result is important. But, it was based on the fact that they suggest that the proof of security ...

15

Constant  Size  Ring  Signature  Without  Random  Oracle

Constant Size Ring Signature Without Random Oracle

... Our major contribution is to present a generic technique to build a ring signature scheme on top of any compatible signature scheme, (such as Full-Boneh-Boyen [3]) having size independent of the cardinality of the ring. ...

18

Reset  Indifferentiability  from  Weakened  Random  Oracle  Salvages  One-pass  Hash  Functions

Reset Indifferentiability from Weakened Random Oracle Salvages One-pass Hash Functions

... We propose a WRO methodology which is based on “Reset Indifferentiability from Weakened Random Oracle ( WRO )” in order to ensure the S -security of C with H U . This paper deals with the ChopMD construction ...

28

A Pairing Free Secure Identity-based Aggregate Signature Scheme Under Random Oracle

A Pairing Free Secure Identity-based Aggregate Signature Scheme Under Random Oracle

... The rest of the paper is organized as follow : section two presents the digital signature approach versus the water marking. Also, section three describes preliminaries. Then section four introduces the generic model for ...

8

Large  Universe  Subset  Predicate  Encryption  Based  on  Static  Assumption (without  Random  Oracle)

Large Universe Subset Predicate Encryption Based on Static Assumption (without Random Oracle)

... Given the above results of [23], the main open question in the context of SPE is the following. Can we realize an adaptively secure SPE in the large universe setting under some static assumption without random ...

31

IND-CCA-secure  Key  Encapsulation  Mechanism  in  the  Quantum  Random  Oracle  Model,  Revisited

IND-CCA-secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited

... Abstract. With the gradual progress of NIST’s post-quantum cryptog- raphy standardization, the Round-1 KEM proposals have been posted for public to discuss and evaluate. Among the IND-CCA-secure KEM con- structions, ...

44

An  Efficient  Transform  from  Sigma  Protocols  to  NIZK  with  a  CRS   and  Non-Programmable  Random  Oracle

An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle

... The random-oracle saga. Reliance on the random oracle model is controversial, with strong advocates on one side and strong opponents on the ...the random oracle model is ...a ...

16

(Tightly)  QCCA-Secure  Key-Encapsulation  Mechanism  in  the  Quantum  Random  Oracle  Model

(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model

... Abstract. This paper studies indistinguishability against quantum chosen-ciphertext attacks (IND-qCCA se- curity) of key-encapsulation mechanisms (KEMs) in quantum random oracle model (QROM). We show that ...

14

Key  Encapsulation  from  Noisy  Key  Agreement  in  the  Quantum  Random  Oracle  Model

Key Encapsulation from Noisy Key Agreement in the Quantum Random Oracle Model

... haves similar to the expected number of times a particular query was made by an adversary throughout the entire computation. We use this notion as a starting point to derive lemmata that enable refined argumentation ...

49

Making  Existential-Unforgeable  Signatures  Strongly  Unforgeable  in  the  Quantum  Random-Oracle  Model

Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model

... quantum random-oracle model under reasonable com- putational ...quantum random-oracle ...quantum random-oracle in a new ...

16

Random-Oracle  Uninstantiability  from  Indistinguishability  Obfuscation

Random-Oracle Uninstantiability from Indistinguishability Obfuscation

... We believe that the structural soundness of ROM schemes should be further validated by studying if attacks similar to those given in this work can be launched against them. To provably rule out such attacks one needs to ...

41

Show all 9054 documents...

Related subjects