• No results found

Using 1-1 One-Way Functions

(Almost)  Optimal  Constructions  of  UOWHFs  from 1-to-1,  Regular  One-way  Functions   and  Beyond

(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-way Functions and Beyond

... [6] Oded Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001. [7] Oded Goldreich, Hugo Krawczyk, and Michael Luby. On the existence of pseudorandom generators. SIAM Journal on Computing, ...

30

On  Constructing  Universal  One-Way  Hash  Functions  from  Arbitrary  One-Way  Functions

On Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions

... 1.1.4 Making All Siblings Hard We now show how to make all siblings of a given initial string hard to find. Roughly speaking, we do this by ensuring that no easy siblings remain. The intuition behind the step is actually ...

27

Candidate  One-Way  Functions   and  One-Way  Permutations  Based  on  Quasigroup  String  Transformations

Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations

... quasigroup one-way functions that we want to mention in this paper, and that is similar to the properties that have been already found in other one-way functions is the property ...

14

On  Constructing  Parallel  Pseudorandom  Generators  from  One-Way  Functions

On Constructing Parallel Pseudorandom Generators from One-Way Functions

... Table 1, even with stretch s = 1? The problems we must solve (to answer this question) depend on what kind of one-way function the PRG construction starts ...

28

Monotone Circuits: One-Way Functions versus Pseudorandom Generators

Monotone Circuits: One-Way Functions versus Pseudorandom Generators

... exist one-way functions, then there exist one-way functions that are computable by uniform families of polynomial-size monotone ...these one-way functions ...

8

Hardness  of  Non-Interactive  Differential  Privacy  from  One-Way  Functions

Hardness of Non-Interactive Differential Privacy from One-Way Functions

... learning using just OWFs [PV88], and one can even show the hardness of learning simple concept classes ...by using more structured complexity ...

27

Biological One-way Functions

Biological One-way Functions

... two one-way ...biological one-way function, which is a descriptive term for information security researchers to capture the essence of the ...biological one-way function ...

8

Adaptive One-way Functions and Applications

Adaptive One-way Functions and Applications

... and refer the reader to [29] for a formal definition of the notion we consider in this work. Non-malleable ZK proofs: An informal definition. Let Π tag be a tag-based family of ZK proofs. Consider a man-in-the-middle ...

18

On  the  Existence  of  Extractable  One-Way  Functions

On the Existence of Extractable One-Way Functions

... when using ex- tractable functions with other components in a larger cryptographic scheme or protocol, an adversary A may gather information z from other components and use it as additional auxiliary input ...

42

Constant  Round  Non-Malleable  Protocols  using  One  Way  Functions

Constant Round Non-Malleable Protocols using One Way Functions

... prove one-many non-malleability of hbC, bRi, we construct a p-compatible distribution by simply running the extractor E one by one on each session on the ...

28

Asymmetric cryptography and trapdoor one-way functions

Asymmetric cryptography and trapdoor one-way functions

... ture using two Altera® boards, with one constantly generating random numbers using a data encryption standard (DES) random-bit generator and the second containing the RSA-implemented design that ...

13

One-Way  Functions   and (Im)perfect  Obfuscation

One-Way Functions and (Im)perfect Obfuscation

... Using iO for 3CNFs. We show how the protocol from above can be modified to get an SZK- argument while assuming iO for 3CNF formulas only. Let the length of the secret s be ` and denote s = s 1 , . . . , s ` ...

26

Algebraic (Trapdoor)  One  Way  Functions   and  their  Applications

Algebraic (Trapdoor) One Way Functions and their Applications

... 44. B. Yee. Using Secure Coprocessors. PhD thesis, Carnegie Mellon University, 1994. A A linearly-homomorphic signature secure in the standard model for a bounded number of datasets In this section we show that by ...

39

Garbled  RAM  From  One-Way  Functions

Garbled RAM From One-Way Functions

... As already pointed, having access to the root key enables reading any bit from memory, and this process involves reading a sequence of d − 1 keys from memory. Our idea of key evolution is that in the process of ...

32

Foundations  of  Non-Malleable  Hash   and  One-Way  Functions

Foundations of Non-Malleable Hash and One-Way Functions

... Exp cnmh H , A ,R − 0 (k) = 1 i is likely to be negligible. To prevent the definition from being trivially unsatisfiable, we can try to limit R so that the relations only look at parts of x ∗ , as we do in Theorem ...

27

Candidate One-Way Functions Based on Expander Graphs

Candidate One-Way Functions Based on Expander Graphs

... Expander Graphs Oded Goldreich Abstract. We suggest a candidate one-way function using combinato- rial constructs such as expander graphs. These graphs are used to deter- mine a sequence of small ...

12

An  Efficient  Multistage  Secret  Sharing  Scheme  Using  Linear  One-way  Functions   and  Bilinear  Maps

An Efficient Multistage Secret Sharing Scheme Using Linear One-way Functions and Bilinear Maps

... A One-Stage Multisecret Sharing (OSMSS) scheme is a special case of MSSS schemes that all secrets are recovered simulta- ...linear one-way functions, we show that the previous schemes can be ...

10

Adaptively  Secure  Garbled  Circuits  from  One-Way  Functions

Adaptively Secure Garbled Circuits from One-Way Functions

... However, in many cases, creating the garbled circuit C e f for the function f is expensive and we would like to do this off-line before the inputs x A , x B are known to Alice and Bob. Once the inputs become known, the ...

37

Saving  Private  Randomness  in  One-Way  Functions   and  Pseudorandom  Generators

Saving Private Randomness in One-Way Functions and Pseudorandom Generators

... whether one can save on secret random bits at the expense of more public random ...bits. Using a shorter secret input is highly desirable, not only because it saves resources, but also because it can yield ...

25

Non-Interactive  Secure  Computation  from  One-Way  Functions

Non-Interactive Secure Computation from One-Way Functions

... token using different inputs! While this might seem strange at first, the key observation is that S performs only “encrypted” computation in its inter- action with the ...token using different inputs, he ...

22

Show all 10000 documents...

Related subjects