搜索结果: 1-15 共查到“军事学 Pseudorandom functions”相关记录40条 . 查询时间(0.14 秒)
Pseudorandom functions are traditionally built upon block ciphers, but with the trend of permutation based cryptography, it is a natural question to investigate the design of pseudorandom functions fr...
In 1984, Goldreich, Goldwasser and Micali formalized the concept of pseudorandom functions and proposed a construction based on any length-doubling pseudorandom generator. Since then, pseudorandom fun...
Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps
Pseudorandom functions related-key security multilinear maps
2017/6/2
Due to the vast number of successful related-key attacks against existing block-ciphers, related-key security has become a common design goal for such primitives. In these attacks, the adversary is no...
Constrained Keys for Invertible Pseudorandom Functions
pseudorandom functions (PRFs) invertible PRFs constrained PRFs
2017/5/31
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 wid...
Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use d...
EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves
oblivious psuedorandom function elliptic curve cryptosystem multi-party computation
2017/2/20
We introduce a secure elliptic curve oblivious pseudorandom function (EC-OPRF) which operates by hashing strings onto an elliptic curve to provide a simple and efficient mechanism for computing an obl...
Verifiable and Delegatable Constrained Pseudorandom Functions for Unconstrained Inputs
constrained pseudorandom functions verifiable constrained pseudorandom function key delegation
2016/12/10
Constrained pseudorandom functions (CPRF) are a fundamental extension of the notion of traditional pseudorandom functions (PRF). A CPRF enables a master PRF key holder to issue constrained keys corres...
Fast Pseudorandom Functions Based on Expander Graphs
foundations pseudo-random functions Goldreich's OWF
2016/12/10
Our proofs are based on a new search-to-decision reduction for expander-based functions. This extends a previous reduction of the first author (STOC 2012) which was applicable for the special case of ...
On the complexity of constructing pseudorandom functions (especially when they don't exist)
OWF PRF
2016/4/6
We study the complexity of black-box constructions of pseudorandom functions
(PRF) from one-way functions (OWF) that are secure against non-uniform adversaries.
We show that if OWF do not exist, the...
A constrained pseudo random function (PRF) behaves like a standard PRF, but with the added feature that the (master) secret key holder, having secret key K, can produce a constrained key, K{f}, that a...
Tightly-Secure Pseudorandom Functions via Work Factor Partitioning
Tight security pseudorandom functions provable security
2016/2/23
We introduce a new technique for tight security proofs called work
factor partitioning. Using this technique in a modified version of the framework
of Dottling and Schr ¨ oder (CRYPTO 2015), we obta...
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
Symmetric Cryptography Low-depth PRFs Learning Parity with Noise
2016/2/23
Pseudorandom functions (PRFs) play a central role in symmetric cryptography. While in principle
they can be built from any one-way functions by going through the generic HILL (SICOMP
1999) and GGM (...
New and Improved Key-Homomorphic Pseudorandom Functions
Efficient Multi-Party Computation Public Verifiability Electronic Voting
2016/1/26
In the last few years the efficiency of secure multi-party computation (MPC) increased in
several orders of magnitudes. However, this alone might not be enough if we want MPC protocols to be
used in...
Publicly Evaluable Pseudorandom Functions and Their Applications
publicly evaluable PRF HPS
2016/1/23
We put forth the notion of publicly evaluable pseudorandom functions (PEPRFs), which is a non-trivial extension of the standard pseudorandom functions (PRFs). Briefly, PEPRFs are defined over domain...
Fully secure constrained pseudorandom functions using random oracles
constrained pseudorandom functions adaptive security non-interactive key exchange
2016/1/9
A constrained pseudorandom function (CPRF) PRF allows to derive constrained evaluation
keys that only allow to evaluate PRF on a subset of inputs. CPRFs have only recently been
introduced independen...