Public-Key Authenticated Encryption

2011 ◽  
pp. 1001-1001
Keyword(s):  
Public Key ◽  
Authenticated Encryption

Public-key authenticated encryption with keyword search revisited: Security model and constructions

2020 ◽  
Vol 516 ◽  
pp. 515-528 ◽  
Author(s):  
Baodong Qin ◽  
Yu Chen ◽  
Qiong Huang ◽  
Ximeng Liu ◽  
Dong Zheng
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Security Model ◽  
Authenticated Encryption

Dual-Server Public-Key Authenticated Encryption With Keyword Search

2019 ◽  
pp. 1-1
Author(s):  
Biwen Chen ◽  
Libing Wu ◽  
Sherali Zeadally ◽  
Debiao He
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Authenticated Encryption

scholarly journals Security of Symmetric Primitives under Incorrect Usage of Keys

2017 ◽  
pp. 449-473 ◽  
Author(s):  
Pooya Farshim ◽  
Claudio Orlandi ◽  
Razvan Rosie
Keyword(s):  
Protocol Design ◽  
Public Key ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Public Key Encryption ◽  
Authentication Codes ◽  
Generic Composition ◽  
Left And Right ◽  
Incorrect Usage ◽  
Basic Level

We study the security of symmetric primitives under the incorrect usage of keys. Roughly speaking, a key-robust scheme does not output ciphertexts/tags that are valid with respect to distinct keys. Key-robustness is a notion that is often tacitly expected/assumed in protocol design — as is the case with anonymous auction, oblivious transfer, or public-key encryption. We formalize simple, yet strong definitions of key robustness for authenticated-encryption, message-authentication codes and PRFs. We show standard notions (such as AE or PRF security) guarantee a basic level of key-robustness under honestly generated keys, but fail to imply keyrobustness under adversarially generated (or known) keys. We show robust encryption and MACs compose well through generic composition, and identify robust PRFs as the main primitive used in building robust schemes. Standard hash functions are expected to satisfy key-robustness and PRF security, and hence suffice for practical instantiations. We however provide further theoretical justifications (in the standardmodel) by constructing robust PRFs from (left-and-right) collision-resistant PRGs.

Improved Security Model for Public-Key Authenticated Encryption with Keyword Search

2021 ◽  
pp. 19-38
Author(s):  
Baodong Qin ◽  
Hui Cui ◽  
Xiaokun Zheng ◽  
Dong Zheng
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Security Model ◽  
Authenticated Encryption

Optimized Electronic Cash Scheme with Fast Public Key Algorithm

2010 ◽  
Vol 20-23 ◽  
pp. 532-538
Author(s):  
Xuan Wu Zhou
Keyword(s):  
Discrete Logarithm ◽  
System Optimization ◽  
Public Key ◽  
Secret Message ◽  
Authenticated Encryption ◽  
Electronic Cash ◽  
Forgery Attack ◽  
System Parameters ◽  
Asymmetric Cryptography ◽  
Software And Hardware

In the paper, we analyzed the system optimization algorithms in e-cash (electronic cash) by improving the efficiency of e-cash for software and hardware application. As for the fast asymmetric cryptography algorithms in e-cash scheme, we presented basic interactive protocols based on discrete logarithm cryptosystem. In the protocol, the interacting algorithms achieve authenticated encryption in secret transmission algorithms, the verification of signature and transmission of secret message can be fulfilled in a single algorithm, and therefore the complexity of authentication algorithms in e-cash scheme is greatly reduced. As a comparison with traditional e-cash schemes, we presented an optimized e-cash scheme based on ECC (Elliptic Curves Cryptosystem). The cryptography algorithms of the scheme make full use of the superiority of ECC fast algorithms, thus the optimized e-cash scheme effectively avoids illegal distribution of e-cash and generalized forgery attack on system parameters with less system overheads.

scholarly journals Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

2017 ◽  
Vol 2017 ◽  
pp. 1-27 ◽  
Author(s):  
Shuai Han ◽  
Shengli Liu ◽  
Lin Lyu
Keyword(s):  
Public Key ◽  
Authenticated Encryption ◽  
Public Key Encryption ◽  
Secret Key ◽  
Diffie Hellman ◽  
Affine Functions ◽  
Generic Construction ◽  
Hash Proof System ◽  
Auxiliary Input ◽  
Ddh Assumption

KDM[F]-CCA security of public-key encryption (PKE) ensures the privacy of key-dependent messages f(sk) which are closely related to the secret key sk, where f∈F, even if the adversary is allowed to make decryption queries. In this paper, we study the design of KDM-CCA secure PKE. To this end, we develop a new primitive named Auxiliary-Input Authenticated Encryption (AIAE). For AIAE, we introduce two related-key attack (RKA) security notions, including IND-RKA and weak-INT-RKA. We present a generic construction of AIAE from tag-based hash proof system (HPS) and one-time secure authenticated encryption (AE) and give an instantiation of AIAE under the Decisional Diffie-Hellman (DDH) assumption. Using AIAE as an essential building block, we give two constructions of efficient KDM-CCA secure PKE based on the DDH and the Decisional Composite Residuosity (DCR) assumptions. Specifically, (i) our first PKE construction is the first one achieving KDM[Faff]-CCA security for the set of affine functions and compactness of ciphertexts simultaneously. (ii) Our second PKE construction is the first one achieving KDM[Fpolyd]-CCA security for the set of polynomial functions and almost compactness of ciphertexts simultaneously. Our PKE constructions are very efficient; in particular, they are pairing-free and NIZK-free.

scholarly journals An efficient and secure public key authenticated encryption with keyword search in the logarithmic search time

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Lidong Han ◽  
Junling Guo ◽  
Guang Yang ◽  
Qi Xie ◽  
Chengliang Tian
Keyword(s):  
Keyword Search ◽  
Search Time ◽  
Public Key ◽  
Authenticated Encryption
Sign in / Sign up

Export Citation Format

Share Document