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
Building covert timing channels by packet rearrangement over mobile networks
TL;DR: This work is the first to build a CTC using RTCP packet rearrangement suitable for VoLTE traffic and proves that the proposed CTC is statistically undetectable and outperforms the IPD-based CTCs in terms of robustness.
Journal ArticleDOI
Modeling and clustering attacker activities in IoT through machine learning techniques
TL;DR: A Machine Learning-based method for modeling attacker activities based on the following intuitive observations: attackers in the same botnet tend to launch temporally close attacks, and attack temporal patterns using a special class of point process called Multivariate Hawkes Process.
Journal ArticleDOI
Low-latency orchestration for workflow-oriented service function chain in edge computing
TL;DR: A Dynamic Minimum Response Time considering Same Level (DMRT_SL) has been proposed to efficiently map the workflow-like requests in edge computing and is seen from the data obtained from a large number of simulation experiments as particularly outstanding in terms of response time delay.
Journal ArticleDOI
An authenticated asymmetric group key agreement based on attribute encryption
TL;DR: An authenticated asymmetric group key agreement based on attribute encryption (ABE-AAGKA) is proposed, which combines the advantages of attribute encryption and identity authentication and is proven to be secure under the inverse computational Diffie-Hellman (ICDH) problem assumption.
Journal ArticleDOI
Establishing a software defect prediction model via effective dimension reduction
TL;DR: A LTSA algorithm is used to extract the intrinsic structure of low-dimensional data and performs effective dimension reduction and the model employs the SVM algorithm as the basic classifier of software defect distribution prediction model.
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.