37,203 Hits in 5.4 sec

A theory of dictionary attacks and its complexity

S. Delaune, F. Jacquemard
Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004.  
Constraint solving is the basis of a NP algorithm for the protocol insecurity problem in the presence of dictionary attacks, assuming a bounded number of sessions.  ...  First, we define a theory of these attacks: we introduce an inference system modeling the guessing capabilities of an intruder. This system extends the classical Dolev-Yao rules.  ...  Acknowledgments The authors wish to thank Hubert Comon-Lundh for his precious assistance to this work, and Ralf Treinen for his reading of a preliminary version of this paper.  ... 
doi:10.1109/csfw.2004.1310728 fatcat:5fe6ei2berhhjaukq7bf2yltiy

The Scale-free Network of Passwords : Visualization and Estimation of Empirical Passwords [article]

Xiujia Guo, Haibo Chen, Xuqin Liu, Xiangyu Xu, Zhong Chen
2015 arXiv   pre-print
We also give a lower bound of the minimum size of the dictionary needed to compromise arbitrary ratio of any given password set by proving that it is equivalent to the minimum dominating set problem, which  ...  Furthermore, we propose a model of statistical guessing attack from the perspective of the data's topological space, which provide an explanation of the "cracking curve".  ...  ACKNOWLEDGMENT This work would not be possible without the inspiration of Zhu Chen, Huang Xin and Wang Ding during our weekly beneficial talks.  ... 
arXiv:1511.08324v1 fatcat:wrlzmjmkffapfocprq62fvitkm

On the security of a secure Lempel-Ziv-Welch (LZW) algorithm

Shujun Li, Chengqing Li, Jay C.-C. Kuo
2011 2011 IEEE International Conference on Multimedia and Expo  
The complexity of the chosen-plaintext attack is O(M L), where M is the number of chosen plaintexts and L is the size of the ciphertext.  ...  A chosenplaintext attack is proposed to break all ciphertext indices corresponding to single-symbol dictionary entries.  ...  size is not large enough 1 ) or very rare that all 2-symbol strings coded in the dictionary although it remains possible in theory.  ... 
doi:10.1109/icme.2011.6011939 dblp:conf/icmcs/LiLK11 fatcat:nspds5vcpjdwbph3m6nyamiuqe

CAPTCHA challenge strings: problems and improvements

Jon Bentley, Colin Mallows, Kazem Taghva, Xiaofan Lin
2006 Document Recognition and Retrieval XIII  
Typical CAPTCHAs present a challenge string consisting of a visually distorted sequence of letters and perhaps numbers, which in theory only a human can read.  ...  We examine the three most common types of challenge strings, dictionary words, Markov text, and random strings, and find substantial weaknesses in each.  ...  The authors are grateful for the helpful feedback of many of the participants at the HIP 2005 Workshop, especially Henry Baird, Andrei Broder, Kumar Chellapilla, Dan Lopresti, and Patrice Simard.  ... 
doi:10.1117/12.650644 dblp:conf/drr/BentleyM06 fatcat:ez3wikdjl5abfnpvj2wjthfwta

The security of machine learning

Marco Barreno, Blaine Nelson, Anthony D. Joseph, J. D. Tygar
2010 Machine Learning  
Machine learning has become a fundamental tool for computer security since it can rapidly evolve to changing and complex situations.  ...  We also illustrate our taxonomy by showing how it can guide attacks against SpamBayes, a popular statistical spam filter. Finally, we discuss how our taxonomy suggests new lines of defenses.  ...  The opinions expressed in this paper are solely those of the authors and do not necessarily reflect the opinions of any funding agency, the State of California, or the U.S. government.  ... 
doi:10.1007/s10994-010-5188-5 fatcat:3ytty65oknh7lkl6tfovfmu5ra

Secure Wireless Communication Protocol: To Avoid Vulnerabilities in Shared Authentication

Varun Shukla, Atul Chaturvedi, Neelam Srivastava
2017 Communications on Applied Electronics  
It can be shown that MITM (Man in the middle attack) based on dictionary attack can be launched very easily and the security of entire network goes down.  ...  Routers are used to connect both similar and dissimilar LANs. Routers are connected to access points. Access point provides wireless connectivity of a wired LAN.  ...  This is a series flaw in shared authentication because it is a simple challenge response protocol. The design is vulnerable to dictionary attacks and MITM [8][9][10].  ... 
doi:10.5120/cae2017652680 fatcat:ffmahtcvkba4jje4guqgvtb5gu

An analysis of Markov password against Brute force attack for effective web applications

S. Vaithyasubramanian, A. Christy, D. Saravanan
2014 Applied Mathematical Sciences  
Common attacks on Password s are Brute force attack, Dictionary attack and Hybrid attack. In this paper, a report on a study of brute force attack on Markov Passwords has been done.  ...  A novel method of Alphanumeric Password for improving the security is "The Markov Password". Markov Passwords are created using the model of the Markov chain.  ...  Brute-force Attack is the most "infallible" attack and it is an application of Brute force search. This is almost a foolproof attack to anything.  ... 
doi:10.12988/ams.2014.47579 fatcat:u7pkq2cg65dfvg4mw26cnka7bq

A Survey on Using Kolmogorov Complexity in Cybersecurity

João S. Resende, Rolando Martins, Luís Antunes
2019 Entropy  
There is already some research towards solutions and methods to predict new attacks or classify variants of previous known attacks, such as (algorithmic) information theory.  ...  This survey combines all relevant applications of this topic (also known as Kolmogorov Complexity) in the security and privacy domains.  ...  As it processes its input, the dictionary grows.  ... 
doi:10.3390/e21121196 fatcat:6ksj757ojjhxfisbmimbdlliym

Page 208 of The South Atlantic Quarterly Vol. 56, Issue 2 [page]

1957 The South Atlantic Quarterly  
The family remains, but only in the bare dictionary sense of a “set of parents and children living together”; it remains only as the background for an intense, dramatic struggle of a kind the nineteenth-century  ...  a prison, the Oedipus theory seemed to make it a prison that was simply inescapable.  ... 

Feature Extraction and Feature Selection : Reducing Data Complexity with Apache Spark

Dimitrios Sisiaridis, Olivier Markowitch
2017 International journal of network security and its applications  
Feature extraction and feature selection are the first tasks in pre-processing of input logs in order to detect cyber security threats and attacks while utilizing machine learning.  ...  When it comes to the analysis of heterogeneous data derived from different sources, these tasks are found to be time-consuming and difficult to be managed efficiently.  ...  In Figure 3 , the exploratory analysis has revealed that the dictionary as a list of multi-nested dictionaries; each one of the latter present a complex structure with further levels.  ... 
doi:10.5121/ijnsa.2017.9604 fatcat:gell6jwlkvbvfcqfgyoghdolvu

RSA-Based Password-Authenticated Key Exchange, Revisited

2008 IEICE transactions on information and systems  
The on-line dictionary attack is a series of exhaustive searches for a password on-line.  ...  He served as the President of the Society of Information Theory and its Applications in 1997, of the IEICE Engineering Sciences Society in 1998, and of the IEEE Information Theory Society in 2004.  ...  He is a member of IACR.  ... 
doi:10.1093/ietisy/e91-d.5.1424 fatcat:i4nkmgvmmbe6ljdvzzx66mu5ji

Quantifying Shannon's Work Function for Cryptanalytic Attacks [article]

R. J. J. H. van Son
2010 arXiv   pre-print
A simple cost function is defined which allows to quantify a wide range of theoretical and real computational resources.  ...  A theoretical understanding of these resource limitations is needed to evaluate the security of cryptographic primitives and procedures.  ...  , and algorithmic complexity theory with space and time bounded automata [5] .  ... 
arXiv:1003.2123v1 fatcat:7k7yyt7f3zb4ff5r55dtbclade

Review of Rhea Complex: A Detour Around Oedipus Complex

No authorship indicated
1987 Contemporary Psychology  
Dictionary of concepts, terms, research, methodology, and theories concerning the socialization, cognitive, and emotional growth of chil- dren.  ...  It is written in dictionary style from A to Z, with short entries on terms, concepts, research processes, method- ology, and biographies of well-known psychologists. References. Index.  ... 
doi:10.1037/027499 fatcat:dvacdyvvnvbphfkfm6idybcwxq

Password Interception in a SSL/TLS Channel [chapter]

Brice Canvel, Alain Hiltgen, Serge Vaudenay, Martin Vuagnoux
2003 Lecture Notes in Computer Science  
In this paper we extend the attack and optimize it.  ...  This attack was not possible against SSL/TLS due to both unavailability of the side channel (errors are encrypted) and premature abortion of the session in case of errors.  ...  We would also like to thank Bodo Möller for his immediate feedback and the OpenSSL community for caring about our attack in real time. We thank the media for there very  ... 
doi:10.1007/978-3-540-45146-4_34 fatcat:t6pgkjpp7rehrpomy2xtaqsoja

An Improving Method of Grid Graphical Password Authentication System

M. Thirunavukkarasu
2017 International Journal of Engineering Research and Applications  
These graphical passwords are usually seen as complex and time consuming. Furthermore, the existing graphical passwords are susceptible to spyware and shoulder surfing attacks.  ...  This conventional authentication method has been shown to be susceptible security threats such as phishing attack, brute force attack, dictionary attack, spyware attack etc.  ...  surfing, insufficient passwords space or complexity and vulnerability of password to dictionary attack for easy to guess passwords.  ... 
doi:10.9790/9622-0705044043 fatcat:a5q7kub67vdzli2l6jho3uqyyi
« Previous Showing results 1 — 15 out of 37,203 results