搜索结果: 1-14 共查到“密码学 bilinear maps”相关记录14条 . 查询时间(0.101 秒)
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank
Predicate Encryption Bilinear Maps Probabilistic Rank
2019/9/19
In predicate encryption for a function ff, an authority can create ciphertexts and secret keys which are associated with `attributes'. A user with decryption key KyKy corresponding to attribute yy can...
We consider the problem of garbling arithmetic circuits and present a garbling scheme for inner-product predicates over exponentially large fields. Our construction stems from a generic transformation...
Unbounded Inner Product Functional Encryption from Bilinear Maps
functional encryption inner product function hiding
2018/7/20
Inner product functional encryption (IPFE), introduced by Abdalla et al. (PKC2015), is a kind of functional encryption supporting only inner product functionality. All previous IPFE schemes are bounde...
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness
Indistinguishability Obfuscation Functional Encryption
2018/6/25
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
In this paper, we initiate the study of \emph{garbled protocols} --- a generalization of Yao's garbled circuits construction to distributed protocols. More specifically, in a garbled protocol construc...
Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs
Indistinguishability Obfuscation Bilinear Maps Block-wise Local PRGs
2017/3/21
Recent works (Lin, EUROCRYPT'16, ePrint'16; Lin and Vaikunthanathan, FOCS'16; Ananth and Sahai, EUROCRYPT'17) establish a tight connection between constructions of indistinguishability obfuscation fro...
Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
Ring LWE Bilinear Maps Identity-Based Encryption
2016/12/10
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing property of the schemes is that it achieves shorter public parameters than previous s...
Two-Input Functional Encryption for Inner Products from Bilinear Maps
Functional encryption Multi-input functional encryption Inner product
2016/5/3
Functional encryption is a new paradigm of public-key encryption that allows a user to compute f(x) on encrypted data CT(x) with a private key SKf to finely control the revealed information. Multi-inp...
Key-policy Attribute-based Encryption for Boolean Circuits from Bilinear Maps
Boolean Circuits Bilinear Maps
2016/1/8
We propose the first Key-policy Attribute-based Encryption (KP-ABE) scheme
for (monotone) Boolean circuits based on bilinear maps. The construction is based on secret
sharing and just one bilinear m...
More Efficient Secure Outsourcing Methods for Bilinear Maps
Bilinear maps Secure delegation Secure Cloud Computing
2015/12/22
Bilinear maps are popular cryptographic primitives which have been commonly used in various modern cryptographic protocols. However, the cost of computation for bilinear maps is expensive because of t...
Efficient and Provably Secure Certificateless Signcryption from Bilinear Maps
Certificateless Signcryption scheme Bilinear pairing
2009/12/29
Signcryption is a cryptographic primitive that fulfills both the functions
of digital signature and public key encryption simultaneously, at a cost significantly
lower than that required by the trad...
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
dynamic accumulators anonymous credentials revocation
2009/6/11
The success of electronic authentication systems, be it e-
ID card systems or Internet authentication systems such as CardSpace,
highly depends on the provided level of user-privacy. Thereby, an imp...
A New Forward Secure Signature Scheme using Bilinear Maps
New Forward Secure Signature Scheme Bilinear Maps
2009/4/10
Forward-secure signatures are used to defeat signature forgeries in cases of key
exposure. In this model, the signature key evolves with time and it is
computationally infeasible for an adversary to...
Shorter Verifier-Local Revocation Group Signatures From Bilinear Maps
LRSW Assumption Group Signature Verifier-Local Revocation
2008/12/15
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous ones.