scholarly journals On the Semantic Security of Functional Encryption Schemes

2013 ◽  
pp. 143-161 ◽  
Author(s):  
Manuel Barbosa ◽  
Pooya Farshim
Keyword(s):  
Functional Encryption ◽  
Semantic Security ◽  
Encryption Schemes

scholarly journals Universal Composability Notion for Functional Encryption Schemes

2013 ◽  
Vol 18 (3) ◽  
pp. 17-26 ◽  
Author(s):  
Rifki Sadikin ◽  
YoungHo Park ◽  
KilHoum Park ◽  
SangJae Moon
Keyword(s):  
Functional Encryption ◽  
Universal Composability ◽  
Encryption Schemes

Simple Functional Encryption Schemes for Inner Products

2015 ◽  
pp. 733-751 ◽  
Author(s):  
Michel Abdalla ◽  
Florian Bourse ◽  
Angelo De Caro ◽  
David Pointcheval
Keyword(s):  
Functional Encryption ◽  
Inner Products ◽  
Encryption Schemes

Lattice-based Dynamical and Anonymous Broadcast Encryption Scheme for Wireless Ad Hoc Networks

2015 ◽  
Vol 15 (03n04) ◽  
pp. 1540005
Author(s):  
FENGHE WANG ◽  
XU AN WANG ◽  
CHUNXIAO WANG
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
Semantic Security ◽  
The Standard Model ◽  
Encryption Schemes ◽  
Hoc Networks ◽  
Learning With Errors Problem

A lattice-based broadcast encryption scheme is proposed for ad hoc networks in this paper. The proposed scheme is dynamical and anonymous simultaneously. The achievements of the dynamic and anonymity properties are efficient. In fact, the broadcaster can send the message to any receivers set without any added operations. The anonymity properties of the proposed scheme can protect the identity of an authorized receiver. Both dynamic and anonymity properties are important for broadcast encryption to used in many cases like wireless ad hoc network. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE). Compared with known lattice-based broadcast encryption schemes, the proposed scheme shares some advantages with respect to the ciphtertext length and the message-ciphtertext expanse factor.

scholarly journals Two Improved Homomorphic Techniques Used in Functional Encryption Schemes

2018 ◽  
Vol 173 ◽  
pp. 03085
Author(s):  
Chengbo Xu ◽  
Shuying Yang
Keyword(s):  
Functional Encryption ◽  
Encryption Schemes

In this paper, we analyze the key homomorphic technique used in constructions of functional encryption schemes and point out its weakness in efficiency. Based on this, we propose two improved homomorphic techniques and show their advantages and weaknesses through the method of comparison.

scholarly journals Illuminating the Dark or how to recover what should not be seen in FE-based classifiers

2020 ◽  
Vol 2020 (2) ◽  
pp. 5-23
Author(s):  
Sergiu Carpov ◽  
Caroline Fontaine ◽  
Damien Ligier ◽  
Renaud Sirdey
Keyword(s):  
Data Privacy ◽  
Information Leakage ◽  
Use Cases ◽  
Security And Privacy ◽  
Functional Encryption ◽  
Cryptographic Primitives ◽  
Encrypted Data ◽  
Current State ◽  
Encryption Schemes ◽  
Privacy Issues

AbstractClassification algorithms/tools become more and more powerful and pervasive. Yet, for some use cases, it is necessary to be able to protect data privacy while benefiting from the functionalities they provide. Among the tools that may be used to ensure such privacy, we are focusing in this paper on functional encryption. These relatively new cryptographic primitives enable the evaluation of functions over encrypted inputs, outputting cleartext results. Theoretically, this property makes them well-suited to process classification over encrypted data in a privacy by design’ rationale, enabling to perform the classification algorithm over encrypted inputs (i.e. without knowing the inputs) while only getting the input classes as a result in the clear.In this paper, we study the security and privacy issues of classifiers using today practical functional encryption schemes. We provide an analysis of the information leakage about the input data that are processed in the encrypted domain with state-of-the-art functional encryption schemes. This study, based on experiments ran on MNIST and Census Income datasets, shows that neural networks are able to partially recover information that should have been kept secret. Hence, great care should be taken when using the currently available functional encryption schemes to build privacy-preserving classification services. It should be emphasized that this work does not attack the cryptographic security of functional encryption schemes, it rather warns the community against the fact that they should be used with caution for some use cases and that the current state-ofthe-art may lead to some operational weaknesses that could be mitigated in the future once more powerful functional encryption schemes are available.

scholarly journals MODELS OF SECURITY OF POST-QUANTUM ASYMMETRIC ENCUSSION BASED ON INDISTINGUISHABILITY

2019 ◽  
pp. 15-26
Author(s):  
M. V. Yesina ◽  
S. G. Vdovenko ◽  
I. D. Gorbenko
Keyword(s):  
Practical Importance ◽  
Plain Text ◽  
Public Key Cryptosystems ◽  
Quantum Cryptanalysis ◽  
Security Models ◽  
Semantic Security ◽  
Different Types ◽  
Encryption Schemes ◽  
Definition Of

The article takes a verifier of equivalence of the quality of indistinguishability (uncertainty) of the semantic security for the cryptosystems defense against of attacker's cryptanalyses based on matched (selected) open text. The issues of analysis and research of security models of post-quantum cryptoalgorithms in relation to cryptoprimitives of all types, the definition of criteria for assessing their compliance with different security models (according to different types of crypto-transformations) are relevant and of practical importance. The indistinguishability (uncertainty) of encrypted text is an important property of the security of many encryption schemes. The indistinguishability (uncertainty) property when attacking on the basis of matched (selected) plain text is considered a basic requirement for the majority of reliably protected public-key cryptosystems. Some schemes also provide an indistinguishability for attack based on selected (selected) encrypted text and attack based on adaptively picked (selected) encrypted text. The indistinguishability (uncertainty) of an attack on the basis of a selected (selected) open text is equivalent to the properties of semantic security. If the cryptosystem has the property of indistinguishability, the attacker will not be able to distinguish between pairs of encrypted texts based on the message that they encrypt. In the case of non-differentiation (uncertainty) of ciphertext protects all known cryptosystems from the intruder which: is a probabilistic Turing machine of polynomial time; has all algorithms; has full access to communications. Using the property of the indeterminacy (uncertainty) of the encrypted text at the present time, it is guaranteed to protect all known symmetric and asymmetric cryptosystems from the classical or quantum cryptanalysis of the intruder. Here are a review of mostly attacks on the encryption security namely an attack based on adaptively matched (selected) ciphertexts, an attack based on adaptively matched (selected) open texts, an attack based on both of this types of texts, an attack based on matched (selected) ciphertexts, an attack based on matched (selected) open texts and a recognition attacks (recognizability).

Sign in / Sign up

Export Citation Format

Share Document