搜索结果: 1-15 共查到“functions and applications”相关记录16条 . 查询时间(0.125 秒)
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Trapdoor functions range trapdoor hash power DDH
2019/9/3
Substantial work on trapdoor functions (TDFs) has led to many powerful notions and applications. However, despite tremendous work and progress, all known constructions have prohibitively large public ...
New Techniques for Efficient Trapdoor Functions and Applications
Trapdoor functions Lossy trapdoor functions Computational Diffie-Hellman assumption
2018/11/13
Prior to our work, all constructions of deterministic encryption based even on the stronger DDH assumption incurred a quadratic gap between the ciphertext and plaintext sizes. Moreover, all DDH-based ...
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption
functional encryption predicate encryption
2017/2/23
We present two practically efficient functional encryption schemes for a large class of quadratic functionalities. Specifically, our constructions enable the computation of so-called bilinear maps on ...
Functional Encryption for Quadratic Functions, and Applications to Predicate Encryption
functional encryption quadratic functions predicate encryption
2016/12/7
We present a functional encryption scheme based on standard assumptions where ciphertexts are associated with a tuple of values (x 1 ,...,x n ) in Z p n, secret keys are associated with a degree-two p...
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
Related-Key Security Pseudorandom Functions
2015/12/29
In this work, we provide a new algebraic framework for pseudorandom functions which encompasses many of the existing algebraic constructions, including the ones by Naor and Reingold (FOCS'97), by Lewk...
Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes
Pseudorandom functions Even-Mansour Constructions Lower Bound Proofs in the Random Oracle Model
2015/12/29
In the last years, much research work has been invested into the security analysis of key alternating ciphers in the random oracle model. These are pseudorandom permutations (PRPs), sometimes also cal...
Compositions of linear functions and applications to hashing
Cayley hash functions linear functions
2015/12/24
Cayley hash functions are based on a simple idea of using a pair of (semi)group elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, b...
We put forth the problem of delegating the evaluation of a pseudorandom function (PRF) to an untrusted proxy. A {\em delegatable PRF}, or DPRF for short, is a new primitive that enables a proxy to eva...
Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security
foundations / non-black-box simulations resettable security
2013/2/21
The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental importance to modern cryptography. In a breakthrough work from 2001, Barak (FOCS'01) introduced a novel non-bla...
Dyadic sets, maximal functions and applications on ax+b,-groups
Exponential growth group Dyadic set Complex interpolation Hardy space BMO
2011/10/10
Let S be the Lie group{mathbb R}^nltimes {mathbb R}$, where ${mathbb R}acts on {mathbb R}^n by dilations,endowed with the left-invariantRiemannian symmetric space structure and the right Haar measure ...
Identity-Based (Lossy) Trapdoor Functions and Applications
Identity-based encryption pairings lattices lossiness
2012/3/26
We provide the first constructions of identity-based (injective) trapdoor functions. Furthermore, they are lossy. Constructions are given both with pairings (DLIN) and lattices (LWE). Our lossy identi...
Variation formulas for principal functions (II) Applications to variation for harmonic spans
pseudoconvexity Stein manifold Riemann surface
2011/1/17
For a domain D in Cz with smooth boundary and for a, b ∈ D, a 6= b, we have the circular (radial) slit mapping P(z)(Q(z)) on D such that P(z) − 1 z−a (Q(z) − 1 z−a ) is regular...
Sup-norm convergence of the empirical process indexed by functions and applications
Sup-norm convergence the empirical process functions and applications
2009/9/23
A new approximation of the unifonn empirical and
quantile processes results in a weak invariance principle indexed by
functions for the general empirical process. Consequences of this
result are we...
Copyrighting Public-key Functions and Applications to Black-box Traitor Tracing
Copyrighting Public-key Functions Black-box Traitor Tracing
2009/1/6
Copyrighting a function is the process of embedding hard-to-remove marks in the function’s
implementation while retaining its original functionality. Here we consider the above
problem in the contex...
New integral inequalities for n-time differentiable functions with applications for pdfs
Incomplete Beta functions Incomplete Expectation
2010/9/10
We present some new integral inequalities for n−time differentiable functions, defined on a finite interval. These inequalities are used to obtain some new estimations for propability density fu...