搜索结果: 1-13 共查到“军事学 prime order groups”相关记录13条 . 查询时间(0.14 秒)
ABE with Tag Made Easy: Concise Framework and New Instantiations in Prime-order Groups
Attribute-based encryption Predicate encoding Prime-order bilinear group
2017/9/13
Among all existing identity-based encryption (IBE) schemes in the bilinear group, Wat-IBE proposed by Waters [CRYPTO, 2009] and JR-IBE proposed by Jutla and Roy [AsiaCrypt, 2013] are quite special. A ...
CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient
Predicate Encryption CCA Security Pair Encoding Scheme
2017/7/6
Attrapadung (Eurocrypt 2014) proposed a generic framework called pair encoding to simplify the design and proof of security of CPA-secure predicate encryption (PE) instantiated in composite order grou...
Attribute Based Encryption: Traitor Tracing, Revocation and Fully Security on Prime Order Groups
Traitor Tracing Revocation Ciphertext-policy Attribute Based Encryption
2016/12/15
A Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows users to specify the access policies without having to know the identities of users. In this paper, we contribute by proposing an ABE sch...
Functional Encryption for Computational Hiding in Prime Order Groups via Pair Encodings
Doubly Selective Security Dual System Encryption Attribute Based Encryption
2016/12/8
Lewko and Waters introduced the computational hiding technique in Crypto'12. In their technique, two computational assumptions that achieve selective and co-selective security proofs lead to adaptive ...
New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
Revocable identity-based encryption static assumptions asymmetric pairings
2016/12/7
Revoking corrupted users is a desirable functionality for cryptosystems. Since Boldyreva,
Goyal, and Kumar (ACM CCS 2008) proposed a notable result for scalable revocation method in
identity-based e...
A Tag Based Encoding: An Efficient Encoding for Predicate Encoding in Prime Order Groups
encodings prime order groups inner product encryption
2016/6/29
We introduce a tag based encoding, a new generic framework for
modular design of Predicate Encryption (PE) schemes in prime order groups. Our
framework is equipped with a compiler which is adaptivel...
Fair mPSI and mPSI-CA: Efficient Constructions in Prime Order Groups with Security in the Standard Model against Malicious Adversary
mPSI mPSI-CA malicious adversary
2016/3/1
In this paper, we propose a construction of fair and efficient mutual Private Set Intersection (mPSI) with linear communication and computation complexities, where the underlying group is of prime ord...
Dual System Encryption Framework in Prime-Order Groups
attribute-based encryption full security generic framework
2015/12/31
We propose a new generic framework for achieving fully secure attribute based encryption
(ABE) in prime-order bilinear groups. It is generic in the sense that it can be applied to
ABE for arbitrary ...
Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
public-key cryptography attribute-based encryption
2015/12/31
We present a modular framework for the design of efficient adaptively secure attribute-based encryption
(ABE) schemes for a large class of predicates under the standard k-Lin assumption in prime-orde...
A study of Pair Encodings: Predicate Encryption in prime order groups
Predicate Encryption Attribute-based Encryption Pair Encoding Schemes
2015/12/31
Pair encodings and predicate encodings, recently introduced by Attrapadung (Eurocrypt 2014)
and Wee (TCC 2014) respectively, greatly simplify the process of designing and analyzing predicate
and att...
Traceable CP-ABE on Prime Order Groups: Fully Secure and Fully Collusion-resistant Blackbox Traceable
Traceable Ciphertext-policy Attribute Based Encryption Prime Order Groups
2015/12/23
In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), access policies associated with
the ciphertexts are generally role-based and the attributes satisfying the policies are generally shared by
...
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
blind signatures pairings composite-order groups
2010/9/9
In this paper, we show that there are limits to such transformations. Specifically, we show that Freeman's properties, cancelling and projecting, cannot simultaneously be obtained using prime-order gr...
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
pairing-based cryptography composite-order groups cryptographic hardness assumptions
2009/11/18
We develop an abstract framework that encompasses the key properties of bilinear groups
of composite order that are required to construct secure pairing-based cryptosystems, and we show how
to use p...