abstract={The problem of identifying an unknown regular set from examples of its members and nonmembers is addressed. It is assumed that the regular set is presented by a minimally adequate Teacher, which can answer membership queries about the set and can also test a conjecture and indicate whether it is equal to the unknown set and provide a counterexample if not. (A counterexample is a string in the symmetric difference of the correct set and the conjectured set.) A learning algorithm L∗ is described that correctly learns any regular set from any minimally adequate Teacher in time polynomial in the number of states of the minimum dfa for the set and the maximum length of any counterexample provided by the Teacher. It is shown that in a stochastic setting the ability of the Teacher to test conjectures may be replaced by a random sampling oracle, {EX}( ). A polynomial-time learning algorithm is shown for a particular problem of context-free language identification.},
address={Duluth, MN, USA},
author={Angluin, Dana},
journal={Information and Computation},
author={Angluin, D.},
journal={Inf.\ and Comp.},
month=nov,
number={2},
pages={87--106},
publisher={Academic Press, Inc.},
title={Learning regular sets from queries and counterexamples},
volume={75},
year={1987}
}
@incollection{Aarts2010Generating,
author={Aarts, Fides and Jonsson, Bengt and Uijen, Johan},
author={Chalupar, Georg and Peherstorfer, Stefan and Poll, Erik and de Ruiter, Joeri},
citeulike-article-id={13837720},
booktitle={Proceedings of the 8th USENIX workshop on
Offensive Technologies (WOOT'14)},
author={Chalupar, G. and Peherstorfer, S. and Poll, E. and Ruiter, J. {de}},
booktitle={Proc.\ USENIX workshop on Offensive Technologies (WOOT'14)},
pages={1--10},
posted-at={2015-11-13 14:58:54},
priority={2},
title={Automated Reverse Engineering using {LEGO}},
year={2014}
}
@incollection{Aarts2010Inference,
author={Aarts, Fides and Schmaltz, Julien and Vaandrager, Frits},
author={Aarts, F. and Schmaltz, J. and Vaandrager, F.},
booktitle={Leveraging Applications of Formal Methods, Verification, and Validation},
editor={Margaria, Tiziana and Steffen, Bernhard},
pages={673--686},
publisher={Springer},
series={LNCS},
...
...
@@ -260,8 +240,7 @@ machine learning algorithms},
@article{Bellare2004Breaking,
abstract={The secure shell ({SSH}) protocol is one of the most popular cryptographic protocols on the Internet. Unfortunately, the current {SSH} authenticated encryption mechanism is insecure. In this paper, we propose several fixes to the {SSH} protocol and, using techniques from modern cryptography, we prove that our modified versions of {SSH} meet strong new chosen-ciphertext privacy and integrity requirements. Furthermore, our proposed fixes will require relatively little modification to the {SSH} protocol and to {SSH} implementations. We believe that our new notions of privacy and integrity for encryption schemes with stateful decryption algorithms will be of independent interest.},
address={New York, NY, USA},
author={Bellare, Mihir and Kohno, Tadayoshi and Namprempre, Chanathip},
author={Bellare, M. and Kohno, T. and Namprempre, C.},
abstract={This paper presents a variety of plaintext-recovering attacks against SSH. We implemented a proof of concept of our attacks against OpenSSH, where we can verifiably recover 14 bits of plaintext from an arbitrary block of ciphertext with probability \$2^{-14}\$ and 32 bits of plaintext from an arbitrary block of ciphertext with probability \$2^{-18}\$. These attacks assume the default configuration of a 128-bit block cipher operating in CBC mode. The paper explains why a combination of flaws in the basic design of SSH leads implementations such as OpenSSH to be open to our attacks, why current provable security results for SSH do not cover our attacks, and how the attacks can be prevented in practice.},
address={Washington, DC, USA},
author={Albrecht, Martin R. and Paterson, Kenneth G. and Watson, Gaven J.},
booktitle={Security and Privacy, 2009 30th IEEE Symposium on},
institution={Inf. Security Group, Univ. of London, Egham, UK},
month=may,
author={Albrecht, M.R. and Paterson, K.G. and Watson, G.J.},
author={Beurdouche, B. and Bhargavan, K. and Delignat-Lavaud, A. and Fournet, C. and Kohlweiss, M. and Pironti, A. and Strub, P.-Y. and Zinzindohoue, J. K.},
title={A Messy State of the Union: Taming the Composite State Machines of TLS},
