搜索结果: 1-4 共查到“Key-Homomorphic PRFs”相关记录4条 . 查询时间(0.235 秒)
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs
oblivious transfer learning with errors multi-party computation
2018/1/11
We present a new approach to extending oblivious transfer with communication complexity that is logarithmic in the security parameter. Our method only makes black-box use of the underlying cryptograph...
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF
Standard Lattice Assumptions PRF
2016/1/5
Boneh et al. (Crypto 13) and Banerjee and Peikert (Crypto 14) constructed pseudorandom
functions (PRFs) from the Learning with Errors (LWE) assumption by embedding combinatorial
objects, a path and ...
Key Homomorphic PRFs and Their Applications
Pseudorandom functions Key homomorphism Non-uniform learning with errors
2016/1/3
A pseudorandom function F : K × X → Y is said to be key homomorphic if given F(k1, x)
and F(k2, x) there is an efficient algorithm to compute F(k1 ⊕ k2, x), where ⊕ denotes a group
operation on k1 a...
Key Homomorphic PRFs and Their Applications
Pseudorandom functions Key homomorphism Non-uniform learning with errors
2015/8/5
A pseudorandom function F : K X ! Y is said to be key homomorphic if given F(k1; x)
and F(k2; x) there is an ecient algorithm to compute F(k1 k2; x), where denotes a group
operation on k1 and ...