A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation
[article]
2018
arXiv
pre-print
First, we formalize the model of server-aided revocable predicate encryption (SR-PE), with rigorous definitions and security notions. Our model can be seen as a non-trivial adaptation of Cui et al.' ...
s work into the PE context. Second, we put forward a lattice-based instantiation of SR-PE. ...
We thank the reviewers for helpful discussions and comments. The research was supported by the "Singapore Ministry of Education under Research Grant MOE2016-T2-2-014(S)". ...
arXiv:1801.07844v1
fatcat:pys76zim4jfelko5epa3ai6wpa
Server-Aided Revocable Identity-Based Encryption from Lattices
[chapter]
2016
Lecture Notes in Computer Science
In [30] , apart from introducing this new model, Qin et al. also described a pairing-based instantiation of SR-IBE. ...
s IBE [1] and the CS method to construct the first revocable IBE from lattices, which satisfies selective security in the standard model. ...
We thank Baodong Qin, Sanjay Bhattacherjee, and the anonymous reviewers for helpful discussions and comments. ...
doi:10.1007/978-3-319-48965-0_7
fatcat:2m2au6tqvrhgdiato6wyj6eslq
Revocable Identity-Based Encryption Revisited: Security Model and Construction
[chapter]
2013
Lecture Notes in Computer Science
Keywords: Identity-based encryption with revocation, decryption key exposure. IDs on each time period T via secure channels. 1 We call the Boneh-Franklin revocable IBE (RIBE) scheme BF-RIBE. ...
In ACM CCS 2008, Boldyreva et al. proposed an elegant way of achieving an Identity-based Encryption (IBE) with efficient revocation, which we call revocable IBE (RIBE). ...
We thank anonymous reviewers of PKC 2013 and members of Shin-Akarui-Angou-Benkyou-Kai for their helpful comments. ...
doi:10.1007/978-3-642-36362-7_14
fatcat:wntxttb33nednb7lnc5huavyqu
Decentralized Ciphertext-Policy Attribute-Based Encryption: A Post-Quantum Construction
2017
Journal of Internet Services and Information Security
In Ciphertext Policy Attribute-Based Encryption (CP-ABE) system, a set of attributes is associated with the private keys of each user. ...
While the number theory-based hardness problems are prone to quantum attacks, lattice-based hardness problems can resist such attacks. ...
In [2] , authors proposed fuzzy identity based encryption from lattices and discussed the difficulties to derive ABE from the scheme. ...
doi:10.22667/jisis.2017.08.31.001
doaj:04cc0011b8de4a709591897a6ebf317a
fatcat:4z72aw6vencxbjs3m54u2udas4
Revocable attribute-based proxy re-encryption
2021
Journal of Mathematical Cryptology
We first formalize the concept of revocable ABPRE and its security model. Then, we propose a lattice-based instantiation of revocable ABPRE. ...
Attribute-based proxy re-encryption (ABPRE), which combines the notions of proxy re-encryption (PRE) and attribute-based encryption (ABE), allows a semi-trusted proxy with re-encryption key to transform ...
Then, we put forward an instantiation of revocable KP-ABPRE from lattices and prove that it is selectively CPA secure in the standard model as per our security definition. ...
doi:10.1515/jmc-2020-0039
fatcat:rxdopwunbzaczoz27uan7g3oyq
Quantum‐resistant anonymous identity‐based encryption with trable identities
2021
IET Information Security
Identity-based encryption (IBE), introduced by Shamir, eliminates the need for publickey infrastructure. ...
The sender can simply encrypt a message by using the recipient's identity (such as email or IP address) without needing to look up the public key. ...
ACKNOWLEDGMENTS The authors thank the anonymous reviewers for their insightful suggestions on this work. ...
doi:10.1049/ise2.12049
fatcat:aoiuabfcvvfd3p77sabxssu3ka
Efficient identity-based encryption with Hierarchical key-insulation from HIBE
2021
Designs, Codes and Cryptography
To realize efficient instantiation from various assumptions, we next propose a generic construction of an HKIBE scheme from any plain HIBE scheme. It is based on Hanaoka et al.' ...
It provides several new and efficient instantiations since most pairing-based HIBE schemes satisfy the requirement. ...
Construction idea The basic idea is quite simple: to encrypt a message M with an identity id and time t, run the HIBE encryption algorithm Enc with M and a hierarchical identity (id, T [L−1,0] (t)) (i.e ...
doi:10.1007/s10623-021-00926-z
fatcat:zrkqkrpjpvew7bwlmlcts3rm7e
Privacy-Preserving Outsourced Inner Product Computation on Encrypted Database
2020
IEEE Transactions on Dependable and Secure Computing
Specifically, one of the data owners outsources the encrypted data to an untrusted cloud server, and wants to share the specific function of these data with a group of data users. ...
A standard IPFE used on this model has two privacy weaknesses regarding the master secret key and the encrypted vector. We propose a strengthened IPFE that revises these weaknesses. ...
Fuchun Lin for the useful discussions to improve the paper writing. This work is supported by National Natural Science Foundation of China under Grant ...
doi:10.1109/tdsc.2020.3001345
fatcat:btoyuxryz5b6nnj6akejx4rq2u
Identity-based remote data checking with a designated verifier
2022
Journal of Cloud Computing: Advances, Systems and Applications
Its security is based on the classical computational Diffie-Hellman and Weil Diffie-Hellman assumptions. ...
To overcome this shortcoming, in this paper, we propose an identity-based auditing protocol with a designated verifier, which not only avoids the introduction of certificates, but also has the desired ...
Acknowledgments The authors would like to thank anonymous referees for their valuable suggestions and comments. ...
doi:10.1186/s13677-022-00279-5
fatcat:pimngz4lmvenpckmjj6z5n24vy
A Survey on Proxy Re-Signature Schemes for Translating One Type of Signature to Another
2021
Cybernetics and Information Technologies
location, delegatee involvement, proxy re-signing rights, duration-based revocation rights, security model environment, and cryptographic approach. ...
Blaze-Bleumer-Strauss discussed PRS in 1998 for translating a signature on a message from Alice into a signature from Bob on the same message at semi-trusted proxy which does not learn any signing-key ...
Unidirectional security against static corruption from (S h a o et al. ...
doi:10.2478/cait-2021-0028
fatcat:47x4h2numbgx5duo6sdbcaqake
Tightly Secure IBE Under Constant-Size Master Public Key
[chapter]
2017
Lecture Notes in Computer Science
Chen and Wee [CRYPTO, 2013] proposed the first almost tightly and adaptively secure IBE in the standard model and left two open problems which called for a tightly secure IBE with (1) constant-size master ...
We can prove its adaptive security in the multi-instance, multi-ciphertext setting [PKC, 2015] based on the decisional subgroup assumption and a subgroup variant of DBDH assumption. ...
Their constructive comments motivated us to extend our basic result to the multi-instance setting and helped us to clarify some technical subtlety. ...
doi:10.1007/978-3-662-54365-8_9
fatcat:w56dsmdr7bhytgnfw5tgbfxa2y
Online) International Journal of Network Security is published both in traditional paper form
2015
International Journal of Network Security
unpublished
To fix it, we suggest to replace the deterministic encryption with a probabilistic encryption. ...
In this paper, we show that the scheme has a drawback that the sender can serve a single receiver only once. The drawback results from the deterministic encryption used. ...
Acknowledgments
Acknowledgments The authors thank the editors and the anonymous referees for their valuable comments and suggestions. This ...
fatcat:tup6p3z7pzc4dpeyn3blmj3foi