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
Design and Analysis of Probing Route to Defense Sink-Hole Attacks for Internet of Things Security
TL;DR: The PRDSA scheme is proposed to resist Sinkhole attack and guarantee security for IoT, which is the first work that can detect, bypass and locate the sinkhole at the same time.
Journal ArticleDOI
Towards detection of phishing websites on client-side using machine learning based approach
Ankit Kumar Jain,Brij B. Gupta +1 more
TL;DR: A machine learning based novel anti-phishing approach that extracts the features from client side only that has relatively high accuracy in detection of phishing websites as it achieved 99.39% true positive rate and 99.09% of overall detection accuracy.
Journal ArticleDOI
GMM and CNN Hybrid Method for Short Utterance Speaker Recognition
TL;DR: A novel model to enhance the recognition accuracy of the short utterance speaker recognition system is proposed using a convolutional neural network to process spectrograms, which can describe speakers better and gains the considerable accuracy as well as the reasonable convergence speed.
Journal ArticleDOI
Secure data uploading scheme for a smart home system
TL;DR: This paper proposes a secure data uploading scheme, which ensures that the cloud validates the data integrity while avoiding malicious home gateways that monitor and modify the data.
Journal ArticleDOI
Service Function Chain Orchestration Across Multiple Domains: A Full Mesh Aggregation Approach
TL;DR: This paper first uses the full mesh aggregation approach to construct an abstracted network to guide the orchestration process, and then proposes two efficient methods for SFC partitioning, and proposes two heuristic algorithms for deploying the sub-chains in multiple domains.
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.