Results 1 - 10 of 3,093

Honey Encryption: Security Beyond the Brute-Force Bound

by Ari Juels, Thomas Ristenpart , 2014
"... Version 1.2 We introduce honey encryption (HE), a simple, general approach to encrypting messages using low min-entropy keys such as passwords. HE is designed to produce a ciphertext which, when decrypted with any of a number of incorrect keys, yields plausible-looking but bogus plaintexts called ho ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
honey messages. A key benefit of HE is that it provides security in cases where too little entropy is available to withstand brute-force attacks that try every key; in this sense, HE provides security beyond conventional brute-force bounds. HE can also provide a hedge against partial disclosure of high

Local Search: Is brute-force avoidable?

by Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
"... Many local search algorithms are based on searching in the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, ..."
Abstract - Cited by 16 (2 self) - Add to MetaCart
, for inputs of size n, a naïve brute-force search of the k-exchange neighborhood requires nO(k) time, which is not practical even for very small values of k. We show that for several classes of sparse graphs, like planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor

In Brute-Force Search of Correlation Bounds for Polynomials

by Frederic Green, Daniel Kreymer, Emanuele Viola , 2011
"... We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various settings of the parameters n, d, p, and q, our results indicate that symmetric polynomials yield the maximum correlation. ..."
Abstract - Add to MetaCart
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various settings of the parameters n, d, p, and q, our results indicate that symmetric polynomials yield the maximum correlation

Dynamic Program Slicing

by Hiralal Agrawal, Joseph R. Horgan , 1990
"... The conventional notion of a program slice---the set of all statements that might affect the value of a variable occurrence---is totally independent of the program input values. Program debugging, however, involves analyzing the program behavior under the specific inputs that revealed the bug. In th ..."
Abstract - Cited by 415 (7 self) - Add to MetaCart
The conventional notion of a program slice---the set of all statements that might affect the value of a variable occurrence---is totally independent of the program input values. Program debugging, however, involves analyzing the program behavior under the specific inputs that revealed the bug

Representation Design and Brute-force Induction in a Boeing Manufacturing Domain

by Patricia Riddle, Richard Segal, Oren Etzioni - Applied Artificial Intelligence , 1994
"... We applied inductive classification techniques to data collected in a Boeing plant with the goal of uncovering possible flaws in the manufacturing process. This application led us to explore two aspects of classical decision-tree induction: (1) Preprocessing and postprocessing and (2) brute-force in ..."
Abstract - Cited by 46 (4 self) - Add to MetaCart
We applied inductive classification techniques to data collected in a Boeing plant with the goal of uncovering possible flaws in the manufacturing process. This application led us to explore two aspects of classical decision-tree induction: (1) Preprocessing and postprocessing and (2) brute-force

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem

by N. G. De Bruijn - INDAG. MATH , 1972
"... In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system is ..."
Abstract - Cited by 369 (1 self) - Add to MetaCart
In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system

Support Vector Machines for Classification and Regression

by Steve R. Gunn - UNIVERSITY OF SOUTHAMPTON, TECHNICAL REPORT , 1998
"... The problem of empirical data modelling is germane to many engineering applications. In empirical data modelling a process of induction is used to build up a model of the system, from which it is hoped to deduce responses of the system that have yet to be observed. Ultimately the quantity and qualit ..."
Abstract - Cited by 357 (5 self) - Add to MetaCart
Risk Minimisation (SRM) principle, which has been shown to be superior, (Gunn et al., 1997), to traditional Empirical Risk Minimisation (ERM) principle, employed by conventional neural networks. SRM minimises an upper bound on the expected risk, as opposed to ERM that minimises the error

Power of Brute-force Search in Strongly-typed Inductive Functional Programming Automation

by Susumu Katayama
"... Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the information of the type and the property that should be satisfied, this algorithm is able to find automatically the short ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the information of the type and the property that should be satisfied, this algorithm is able to find automatically

Representation Design and Brute-force Induction in a Boeing Manufacturing Domain

by Patricia Riddle Boeing, Patricia Riddle, Richard Segal, Oren Etzioni - Applied Artificial Intelligence , 1994
"... We applied inductive classification techniques to data collected in a Boeing plant with the goal of uncovering possible flaws in the manufacturing process. This application led us to explore two aspects of classical decision-tree induction: ffl Pre- and Post-processing: much of our effort was foc ..."
Abstract - Add to MetaCart
was focused on the pre-processing of raw data to make it suitable for induction and the post-processing of learned rules to make them useful to factory personnel. ffl Brute-force Induction: in contrast with standard methods, which perform a greedy search of the space of decision trees, we formulated

GenoGuard: Protecting Genomic Data against Brute-Force Attacks

by unknown authors
"... Abstract—Secure storage of genomic data is of great and increasing importance. The scientific community’s improving ability to interpret individuals ’ genetic materials and the growing size of genetic database populations have been aggravating the potential consequences of data breaches. The prevale ..."
Abstract - Add to MetaCart
sequences of genetic data. In GenoGuard, a potential adversary can attempt exhaus-tively to guess keys or passwords and decrypt via a brute-force attack. We prove that decryption under any key will yield a plausible genome sequence, and that GenoGuard offers an information-theoretic security guarantee
Results 1 - 10 of 3,093