搜索结果: 1-12 共查到“密码学 bilinear groups”相关记录12条 . 查询时间(0.062 秒)
Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups
public-key cryptography Structure-Preserving Signatures
2019/1/2
Structure-Preserving Signatures (SPSs) are a useful tool for the design of modular cryptographic protocols. Recent series of works have shown that by limiting the message space of those schemes to the...
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs
Batch verification bilinear maps Groth-Sahai proofs
2017/8/29
Bilinear groups form the algebraic setting for a multitude of important cryptographic protocols including anonymous credentials, e-cash, e-voting, e-coupon, and loyalty systems. It is typical of such ...
Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups
public-key encryption self-updatable encryption ciphertext update
2016/1/5
In CRYPTO 2012, Sahai et al. raised the concern that in a cloud control system revocation
of past keys should also be accompanied by updation of previously generated ciphertexts in
order to prevent ...
Bilinear groups are often used to create Attribute-Based Encryption (ABE) algorithms.
In particular, they have been used to create an ABE system with multi
authorities, but limited to the ciphertext...
Fully Secure Unbounded Revocable Attribute-Based Encryption in Prime Order Bilinear Groups via Subset Difference Method
attribute-based encryption revocable attribute-based encryption key revocation
2015/12/31
Providing an efficient revocation mechanism for attribute-based encryption (ABE) is of
utmost importance since over time an user’s credentials may be revealed or expired. All previously
known revoca...
A Note on Bilinear Groups of a Large Composite Order
bilinear groups of composite order homomorphic public-key encryption
2014/3/5
We remark that the structure of bilinear groups of a large composite order(at least 1024 bits) could make group operation inefficient and lose the advantages of elliptic curve cryptography which gaine...
New Trapdoor Projection Maps for Composite-Order Bilinear Groups
foundations bilinear groups
2014/3/7
An asymmetric pairing over groups of composite order is a bilinear map $e: G_1 \times G_2 \to G_T$ for groups $G_1$ and $G_2$ of composite order $N=pq$. We observe that a recent construction of pairin...
A Profitable Sub-Prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups
bilinear groups prime-order groups
2014/3/12
Composite-order bilinear groups provide many structural features that have proved useful for both constructing cryptographic primitives and as a technique in security reductions. Despite these conveni...
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
Simulating Features of Composite Prime Order
2012/3/26
In this paper, we explore a general methodology for converting composite order pairing-based cryptosystems into the prime order setting. We employ the dual pairing vector space approach initiated by O...
Signing on Elements in Bilinear Groups for Modular Protocol Design
Digital Signatures Modular Protocol Design Groth-Sahai Proofs Blind Signatures Group Signatures
2010/3/16
This paper addresses the construction of signature schemes whose verification keys, messages,
and signatures are group elements and the verification predicate is a conjunction of
pairing product equ...
Automorphic Signatures in Bilinear Groups
Automorphic Signatures Bilinear Groups yielding blind signatures
2009/7/14
We call signature schemes in bilinear groups automorphic if they have the following
properties: the verification keys lie in the message space, messages and signatures consist of
group elements only...
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive witness-indistinguishability non-interactive zero-knowledge common reference
2008/9/1
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have
played a significant role in the theory of cryptography. However, lack of efficiency has prevented them...