搜索结果: 1-9 共查到“军事学 Without Pairings”相关记录9条 . 查询时间(0.084 秒)
Efficient Group Signature Scheme without Pairings
group signature EDL signature pairings
font style='font-size:12px;'>
2018/11/13
Group signature is a useful cryptographic primitive, which makes every group member sign messages on behalf of a group they belong to. Namely group signature allows that group member anonymously signs...
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings
Functional Encryption multi-input inner-product
font style='font-size:12px;'>
2017/10/9
We present new constructions of multi-input functional encryption (MIFE) schemes for the inner-product functionality that improve the state of the art solution of Abdalla et al. (Eurocrypt 2017) in tw...
Lightweight Symmetric-Key Hidden Vector Encryption without Pairings
Hidden Vector Encryption Symmetric-Key Simulation-Security
font style='font-size:12px;'>
2017/8/28
Hidden vector encryption (HVE), introduced by Boneh and Waters in TCC'07, is an expressive sub-class of predicate encryption, that allows conjunctive, subset, range and comparison queries over encrypt...
Tightly Secure CCA-Secure Encryption without Pairings
public-key encryption CCA security tightness
font style='font-size:12px;'>
2016/2/23
We present the first CCA-secure public-key encryption scheme based on DDH where the
security loss is independent of the number of challenge ciphertexts and the number of decryption queries.
Our cons...
CCA-Secure Proxy Re-Encryption without Pairings
Unidirectional PRE DDH random oracle CCA security
font style='font-size:12px;'>
2009/6/12
In a proxy re-encryption scheme, a semi-trusted proxy can transform a ciphertext under Alice’s public
key into another ciphertext that Bob can decrypt. However, the proxy cannot access the plaintext....
Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings
Proxy re-encryption bilinear pairing chosen-ciphertext security
font style='font-size:12px;'>
2009/6/10
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a
semi-trusted proxy to convert a ciphertext originally intended for Alice into an en-
cryption of the same message intend...
Certificate-Based Signature Schemes without Pairings or Random Oracles
Certificate-Based Signature Schemes Pairings Random Oracles
font style='font-size:12px;'>
2009/6/5
In this paper, we propose two new certificate-based signa-
ture (CBS) schemes with new features and advantages. The first one
is very ecient as it does not require any pairing computation and its
...
Efficient ID-based Threshold Signature Schemes without Pairings
ID-based Threshold Signature Schemes Pairings
font style='font-size:12px;'>
2008/12/17
The focus of this paper is to design an efficient and secure so-
lution addressing the key escrow problem in ID-based signature schemes,
i.e., the Private Key Generator (PKG) knows the user's priva...
Space-Efficient Identity Based Encryption Without Pairings
Space-Efficient Identity Based Encryption Pairings
font style='font-size:12px;'>
2008/8/28
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a.
pairings) on elliptic curves. One exception is an elegant system due to Cocks which builds an
IBE based on t...