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 localization and tracking scheme for target gangs based on big data of Wi-Fi locations
TL;DR: A localization and tracking scheme based on big data of Wi-Fi locations is proposed, and most of the target gangs’ activity pattern are known with only a small number of monitoring devices.
Journal ArticleDOI
Practical public key encryption with selective opening security for receivers
TL;DR: A practical generic PKE construction achieving simulation-based SOA security under chosen-ciphertext attacks for recievers (RSIM-SO-CCA security) based on a KEM and a MAC and the underlying MAC is strong unforgeable under one-time chosen message attacks (sUF-OT-CMA).
Journal ArticleDOI
A countermeasure against cryptographic key leakage in cloud: public-key encryption with continuous leakage and tampering resilience
TL;DR: This paper presents two continuous leakage and tampering resilient CCA secure public-key encryption schemes and shows how to update the secret key to ensure that these schemes are secure against continuous leaking and tampering attacks.
Journal ArticleDOI
Jammer Localization in Multihop Wireless Networks Based on Gravitational Search
TL;DR: This article proposes a jammer localization method based on Gravitational Search Algorithm (GSA), which is a heuristic optimization evolutionary algorithm based on Newton’s law of universal gravitation and mass interactions that outperforms many state-of-the-art algorithms.
Journal ArticleDOI
Fast and secured cloud assisted recovery scheme for compressively sensed signals using new chaotic system
K. Ashwini,R. Amutha +1 more
TL;DR: A novel secured cloud assisted recovery scheme for compressively sensed signals using a proposed new chaotic map that has wider chaotic range and better attributes when compared to existing maps and simulation results prove the efficiency of the proposed cloud assisted scheme.
References
More filters
Book ChapterDOI
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
Ronald Cramer,Victor Shoup +1 more
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
Ronald Cramer,Victor Shoup +1 more
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,Moti Yung +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
Charles Rackoff,Daniel R. Simon +1 more
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.