scispace - formally typeset
Journal ArticleDOI

Insight of the protection for data security under selective opening attacks

TLDR
This paper formalizes the security notion of non-malleability under selective opening attacks (NM-SO security), and explores the relations between NM-SOSecurity and the standard SOA security, the relations among NM-so security notions, and the relations amongst NM- SO security notions.
About
This article is published in Information Sciences.The article was published on 2017-10-01. It has received 147 citations till now. The article focuses on the topics: Cloud computing security & Computer security model.

read more

Citations
More filters
Journal ArticleDOI

A weighted K-member clustering algorithm for K-anonymization

TL;DR: Experimental analysis suggests that the proposed method generates lower information loss, improves the clustering effect, and is less sensitive to outliers as compared with some existing methods.
Journal ArticleDOI

Secure Delegation-Based Authentication for Telecare Medicine Information Systems

TL;DR: This paper presents a new secure delegation-based authentication protocol by using the identity-based cryptography and demonstrates that the proposed scheme provides secure authentication and can provide more security functionaries than the existing delegation- based authentication protocols.
Journal ArticleDOI

A Fine-Grained Attribute Based Data Retrieval with Proxy Re-Encryption Scheme for Data Outsourcing Systems

TL;DR: The proposed scheme achieves fine-grained data access management by adopting KP-ABE mechanism, a delegator can generate the re-encryption key and search indexes for the ciphertexts to be shared over the target delegatee’s attributes.
Journal ArticleDOI

An efficient dynamic ID-based remote user authentication scheme using self-certified public keys for multi-server environments.

TL;DR: Li et al. as discussed by the authors proposed a dynamic ID-based remote user authentication scheme for multi-server environments based on pairing and self-certified public keys, which is secure against various attacks and has many excellent features.
Journal ArticleDOI

Impact of Antenna Selection on Physical-Layer Security of NOMA Networks

TL;DR: The impacts of antenna selection algorithms in decode-and-forward (DF) cooperative nonorthogonal multiple access (NOMA) networks, where the secure information from the relay can be overheard by an eavesdropper in the networks, are studied.
References
More filters
Book ChapterDOI

A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

TL;DR: In this paper, a new public key cryptosystem is proposed and analyzed, which is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. But the scheme is quite practical, and is not provable to be used in practice.
Journal Article

A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack

TL;DR: In this article, a new public key cryptosystem is proposed and analyzed, which is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. But the scheme is quite practical, and is not provable to be used in practice.
Proceedings ArticleDOI

Public-key cryptosystems provably secure against chosen ciphertext attacks

Moni Naor, +1 more
TL;DR: This work shows how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given aPublic-Key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model.
Book ChapterDOI

Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

TL;DR: A formalization of chosen ciphertext attack is given in the model which is stronger than the "lunchtime attack" considered by Naor and Yung, and it is proved a non-interactive public-key cryptosystem based on non-Interactive zero-knowledge proof of knowledge to be secure against it.
Proceedings ArticleDOI

Non-malleable cryptography

TL;DR: Non-malleable schemes for each of the contexts of string commitment and zero-knowledge proofs of possession of knowledge, where a user need not know anything about the number or identity of other system users are presented.
Related Papers (5)