Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information Sciences

Insight of the protection for data security under selective opening attacks

Zhengan Huang, Shengli Liu, Xianping Mao, Kefei Chen, Jin Li

Published May 22, 2017• 156 citations
Publisher
DOI
10.1016/j.ins.2017.05.031

Related papers

Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks

Dingding Jia, Xianhui Lu, Bao Li

Lecture notes in computer science•Jan 1, 2017•19 citations

Simulation-based selective opening security for receivers under chosen-ciphertext attacks

Zhengan Huang, Junzuo Lai, Wenbin Chen +3 more

Designs Codes and Cryptography•Aug 9, 2018•17 citations

IBE with tight security against selective opening and chosen-ciphertext attacks

Dingding Jia, Yamin Liu, Bao Li

Designs Codes and Cryptography•Apr 16, 2020•4 citations

Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack

Junzuo Lai, Robert Huijie Deng, Shengli Liu +2 more

Lecture notes in computer science•Jan 1, 2014•32 citations

On Definitions of Selective Opening Security

Florian Böhl, Dennis Hofheinz, Daniel Kraschewski

Lecture notes in computer science•Jan 1, 2012•62 citations

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

Maryna V. Yesina, Serhii Vdovenko, І.Д. Горбенко

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).

Проблеми створення випробування застосування та експлуатації складних інформаційних систем•Mar 29, 2019•3 citations
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).