D¨ottling, N., Schro¨der, D.: Efficient pseudorandom functions via on-the-fly adap- tation. In: Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference. pp. 329-350 (2015)DS15. Nico Do¨ttling and Dominique Schro¨der. Efficient pseudorandom functions via on-the-fly...
Theory of Cryptography Conference 2250 Accesses Abstract A constrained pseudorandom function (PRF) is a secure PRF for which one can generate constrained keys that can only be used to evaluate the PRF on a subset of the domain. Constrained PRFs are used widely, most notably in applications ...
To understand the definition of a pseudorandom function, it’s good to think of it as a pseudorandom generator whose output isexponentially long, and such that each bit of the output is efficiently computable given the seed. The security is against efficient adversaries that are allowed to look...
Chapter 3 Pseudorandom Functions Pseudorandom functions (PRFs) and their cousins, pseudorandom permutations (PRPs), figure as central tools in the design of protocols, especially those for shared-key cryptography. At one level, PRFs and PRPs can be used to model blockciphers, and they thereb...
The simple algebraic structure of the functions implies additional features. In particular, we show a zero-knowledge proof for statements of the form "y=f/sub s/(x)" and "y/spl ne/f(x)" given a commitment to a key s of a pseudo-random function f/sub s/. 展开 ...
Pseudorandom Functions 3.1 Function Families 来自 Semantic Scholar 喜欢 0 阅读量: 6 摘要: Pseudorandom functions (PRFs) and their cousins, pseudorandom permutations (PRPs), figure as central tools in the design of protocols, especially those for shared-key cryptography. At one level, PRFs and ...
^abGirish, Uma, and Ran Raz. "Eliminating Intermediate Measurements using Pseudorandom Generators." ...
摘要: Related ConceptsRelated ConceptsOne-Way Function; Pseudorandom Number GeneratorDefinitionDefinitionA pseudorandom function is a deterministic function of a key and an input that is indistinguishable fDOI: 10.1007/978-1-4419-5906-5_427 被引量: 2 ...
Pseudo-random functions (PRFs) introduced by Goldwasser, Goldreich, and Micali (FOCS 1984), are one of the most important building blocks in cryptography. A PRF family is a family of seeded functions {fs}, with the property that no efficient adversary can tell the difference between getting ...
Pseudo-randomness of round-off errors in discretized linear maps on the plane First, for an initial key for the AES-based hash function and second, to obtain a seed for the pseudo-random number generator =-=[12]-=- which ... F Vivaldi,I Vladimirov - 《International Journal of Bifurcatio...