[PDF] Top 20 Key-Homomorphic Constrained Pseudorandom Functions
Has 10000 "Key-Homomorphic Constrained Pseudorandom Functions" found on our website. Below are the top 20 most common "Key-Homomorphic Constrained Pseudorandom Functions".
Key-Homomorphic Constrained Pseudorandom Functions
... simultaneously constrained and key homomorphic, where the homomorphic property holds even for constrained ...be key- homomorphic. We then show that the LWE-based ... See full document
30
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF
... of functions allows us to produce constrained keys for functions in this class, which gives us the first standard-lattice-assumption-based con- strained PRF (CPRF) for general bounded-description ... See full document
29
Constraining Pseudorandom Functions Privately
... PRF key sk, and the constrained key is just a program that either evaluates the “real” PRF or the fake PRF, depending on the value of ...PRF key from those under the fake PRF key, the ... See full document
65
Publicly Evaluable Pseudorandom Functions and Their Applications
... recently, constrained PRFs are studied in three concurrent and independent works, by Kiayias et ...of constrained PRFs, and by Boyle, Goldwasser, and Ivan [BGI14] under the name of functional ...In ... See full document
38
Aggregate Pseudorandom Functions and Connections to Learning
... In the second part of this paper, we embark on a study of the connection between the new augmented PRF constructions of recent years (constrained, related-key, aggregate) and the theory of computational ... See full document
38
Bootstrapping Obfuscators via Fast Pseudorandom Functions
... All these works share a similar outline. First it is shown how to use the idealized model to obfuscate a weak complexity class such as NC 1 , and then the weak obfuscator is bootstrapped into a general-purpose obfuscator ... See full document
9
Constrained Verifiable Random Functions
... random functions. A pseudorandom function (PRF) [GGM86] is an efficiently com- putable keyed function F : K × X → Y for which, when the seed k is chosen at random, no efficient attacker should be able to ... See full document
25
Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
... of constrained PRFs in the standard ...of constrained PRFs, where the constrained key is associated with an element x 0 in the input ...The key allows evaluation at all points x 6= x 0 ... See full document
34
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
... of pseudorandom functions, several extensions have been proposed in the literature over the years, with the goal of providing additional functionalities to these ...are constrained PRFs [KPTZ13, ... See full document
29
Constrained Pseudorandom Functions: Verifiable and Delegatable
... based key exchange and so on. Boneh and Waters [BW13] construct constrained PRFs for both bit-fixing predicates and for arbitrary circuit predicates, relying on multilinear ...construct constrained ... See full document
18
Fully secure constrained pseudorandom functions using random oracles
... from constrained keys. In particular, while the functions G K,X,T from Game 6 compute the same group element as the functions G K,X,T from Game 5, the respective encodings may ...as key ... See full document
24
Adaptively Secure Constrained Pseudorandom Functions
... in constrained PRFs with polynomial time reductions ...of constrained PRFs called puncturable ...a key that allows for evaluation at all points x 6= x ∗ ... See full document
15
Boolean functions for homomorphic-friendly stream ciphers
... and many terms. For example, the multiplicative depth of AES is often too large, and its additive depth is still more, to efficiently evaluate it homomorphically. Thus, other symmetric encryption schemes have been ... See full document
14
Title: An Efficient Self-Embedding Watermarking Scheme for Colour Image Tamper Detection and Recovery
... non overlapping blocks of size 8x8 and is done for each colour component. We can achieve a better tamper localization through block division of 8x8. We know that insecure mapping has two problems. First it is vulnerable ... See full document
8
Homomorphic Signatures with Efficient Verification for Polynomial Functions
... use homomorphic authenticators; we refer to these constructions as ...between homomorphic message authen- tication codes [24,10,4] and homomorphic signatures ...of functions one ...schemes ... See full document
19
Online-Offline Homomorphic Signatures for Polynomial Functions
... first homomorphic symmetric authenticators dedicated to Boolean ...upon homomorphic encryption and assumes that the ad- versary does not have access to the results of the MAC verification ...a ... See full document
36
Computational Complexity: A Modern Approach
... cryptographic pseudorandom generators can be used to reduce the randomness requirements of probabilistic algorithms such as the ones we saw in Chapter 7; see also Chapter ... See full document
26
Monotone Circuits: One-Way Functions versus Pseudorandom Generators
... one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that are computable by (uniform) ... See full document
8
Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
... Benefits of inverse-freeness. The use of blockcipher inversion, as in OCB, has mainly two drawbacks, as discussed by Iwata and Yasuda [30]. The first is efficiency. The integration of encryption and decryption ... See full document
42
Homomorphic Signatures from Chameleon Hash Functions
... polynomial functions over signed data [8]. In fact, if we translate these functions to the circuits, then the size of evaluated signatures can grow expo- nentially in the depth of the ...fully ... See full document
13
Related subjects