Automated Proof of Authentication Protocols in a Logic of Events

Mapping Intimacies ◽

10.29007/r7n1 ◽

2018 ◽

Author(s):

Mark Bickford

Keyword(s):

General Purpose ◽

Theorem Prover ◽

Authentication Protocols ◽

Protocol Composition ◽

New Concepts ◽

Causal Ordering ◽

Automated Proof

Using the language of event orderings and event classes, and using a type of atoms to represent nonces, keys, signatures, and ciphertexts, we give an axiomatization of a theory in which authentication protocols can be formally defined and strong authentication properties proven. This theory is inspired by PCL, the protocol composition logic defined by Datta, Derek, Mitchell, and Roy.We developed a general purpose tactic (in the NuPrl theorem prover), and applied it to automatically prove that several protocols satisfy a strong authentication property. Several unexpected subtleties exposed in this development are addressed with new concepts legal protocols, and a fresh signature criterion - and reasoning that makes use of a well-founded causal ordering on events.This work shows that proofs in a logic like PCL can be automated, provides a new and possibly simpler axiomatization for a theory of authentication, and addresses some issues raised in a critique of PCL.

Download Full-text

How a Brain Sees: Constructing Reality

Conscious Mind, Resonant Brain ◽

10.1093/oso/9780190070557.003.0003 ◽

2021 ◽

pp. 86-121

Author(s):

Stephen Grossberg

Keyword(s):

Visual Arts ◽

Explanatory Power ◽

General Purpose ◽

Image Features ◽

Color Spreading ◽

New Concepts ◽

Artistic Styles ◽

Neon Color Spreading ◽

Boundary Completion

The distinction between seeing and knowing, and why our brains even bother to see, are discussed using vivid perceptual examples, including image features without visible qualia that can nonetheless be consciously recognized, The work of Helmholtz and Kanizsa exemplify these issues, including examples of the paradoxical facts that “all boundaries are invisible”, and that brighter objects look closer. Why we do not see the big holes in, and occluders of, our retinas that block light from reaching our photoreceptors is explained, leading to the realization that essentially all percepts are visual illusions. Why they often look real is also explained. The computationally complementary properties of boundary completion and surface filling-in are introduced and their unifying explanatory power is illustrated, including that “all conscious qualia are surface percepts”. Neon color spreading provides a vivid example, as do self-luminous, glary, and glossy percepts. How brains embody general-purpose self-organizing architectures for solving modal problems, more general than AI algorithms, but less general than digital computers, is described. New concepts and mechanisms of such architectures are explained, including hierarchical resolution of uncertainty. Examples from the visual arts and technology are described to illustrate them, including paintings of Baer, Banksy, Bleckner, da Vinci, Gene Davis, Hawthorne, Hensche, Matisse, Monet, Olitski, Seurat, and Stella. Paintings by different artists and artistic schools instinctively emphasize some brain processes over others. These choices exemplify their artistic styles. The role of perspective, T-junctions, and end gaps are used to explain how 2D pictures can induce percepts of 3D scenes.

Download Full-text

The illinois prover: A general purpose resolution theorem prover

8th International Conference on Automated Deduction - Lecture Notes in Computer Science ◽

10.1007/3-540-16780-3_137 ◽

1986 ◽

pp. 685-686 ◽

Cited By ~ 2

Author(s):

Steven Greenbaum ◽

David A. Plaisted

Keyword(s):

General Purpose ◽

Theorem Prover ◽

Resolution Theorem

Download Full-text

Basing a Modeling Environment on a General Purpose Theorem Prover

10.21236/ada460524 ◽

2006 ◽

Cited By ~ 3

Author(s):

Myla Archer

Keyword(s):

General Purpose ◽

Theorem Prover ◽

Modeling Environment

Download Full-text

The HOL-Voss system: Model-checking inside a general-purpose theorem-prover

Higher Order Logic Theorem Proving and Its Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-57826-9_135 ◽

1994 ◽

pp. 185-198 ◽

Cited By ~ 13

Author(s):

Jeffrey Joyce ◽

Carl Seger

Keyword(s):

Model Checking ◽

General Purpose ◽

Theorem Prover ◽

System Model

Download Full-text

AN INTERACTIVE TOOL FOR THE RAPID DEVELOPMENT OF KNOWLEDGE BASES

International Journal of Artificial Intelligence Tools ◽

10.1142/s0218213001000428 ◽

2001 ◽

Vol 10 (01n02) ◽

pp. 65-86 ◽

Cited By ~ 15

Author(s):

DAN I. MOLDOVAN ◽

ROXANA C. GÎRJU

Keyword(s):

Rapid Development ◽

Knowledge Bases ◽

General Purpose ◽

Specific Knowledge ◽

Interactive Mode ◽

Domain Specific ◽

New Concepts ◽

Financial Domain ◽

Domain Specific Knowledge ◽

Knowledge Intensive

It is widely accepted that more knowledge means more intelligence. In many knowledge intensive applications, it is necessary to have extensive domain-specific knowledge in addition to general-purpose knowledge bases. This paper presents a methodology for discovering domain-specific concepts and relationships in an attempt to extend WordNet. The method was tested on five seed concepts selected from the financial domain: interest rate, stock market, inflation, economic growth, and employment. Queries were formed with each of these concepts and a corpus of 5000 sentences was extracted automatically from the Internet and TREC-8 corpora. On this corpus, the system discovered a total of 264 new concepts not defined in WordNet, of which 221 contain the seeds and 43 are other related concepts. The system also discovered 64 relationships that link these concepts with either WordNet concepts or with each other. The relationships were extracted with the help of 22 distinct lexico-syntactic patterns representing four semantic relations. It takes the system approximately 40 minutes per seed working in interactive mode to discover the new concepts and relationships on the 5000 sentence corpus.

Download Full-text

Automated Proof of Resistance of Denial of Service Attacks Using Event with Theorem Prover

Journal of Computers ◽

10.4304/jcp.8.7.1728-1741 ◽

2013 ◽

Vol 8 (7) ◽

Cited By ~ 2

Author(s):

Bo Meng ◽

Wei Huang ◽

Zimao Li

Keyword(s):

Denial Of Service ◽

Theorem Prover ◽

Denial Of Service Attacks ◽

Automated Proof

Download Full-text

SIGMA-CAD: Some New Concepts in Design of General Purpose CAD Systems

10.1109/dac.1978.1585192 ◽

1978 ◽

Author(s):

B. David ◽

G. Vitry

Keyword(s):

General Purpose ◽

Cad Systems ◽

New Concepts

Download Full-text

Novel Approaches to Low-Voltage Scanning Electron Microscopy

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s0424820100180586 ◽

1990 ◽

Vol 48 (1) ◽

pp. 366-367

Author(s):

Arthur V. Jones

Keyword(s):

Electron Microscopy ◽

Scanning Electron Microscopy ◽

Low Voltage ◽

Electron Optics ◽

Current Interest ◽

New Concepts ◽

Opportune Time ◽

Novel Approaches ◽

Voltage Scanning ◽

Scanning Electron

In comparison with the developers of other forms of instrumentation, scanning electron microscope manufacturers are among the most conservative of people. New concepts usually must wait many years before being exploited commercially. The field emission gun, developed by Albert Crewe and his coworkers in 1968 is only now becoming widely available in commercial instruments, while the innovative lens designs of Mulvey are still waiting to be commercially exploited. The associated electronics is still in general based on operating procedures which have changed little since the original microscopes of Oatley and his co-workers.The current interest in low-voltage scanning electron microscopy will, if sub-nanometer resolution is to be obtained in a useable instrument, lead to fundamental changes in the design of the electron optics. Perhaps this is an opportune time to consider other fundamental changes in scanning electron microscopy instrumentation.

Download Full-text