Narrowing terminates for encryption

CC
CSFW
1996
Ninth IEEE Computer Security Foundations Workshop
Abstract - Narrowing terminates for encryption

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by J.K. Millen Articles by Hai-Ping Ko

Ninth IEEE Computer Security Foundations Workshop

Dromquinna Manor, Kenmare, County Kerry, Ireland

March 10-March 12

ISBN: 0-8186-7522-5

	ASCII Text	x
	J.K. Millen, Hai-Ping Ko, "Narrowing terminates for encryption," Computer Security Foundations Workshop, IEEE, pp. 39, Ninth IEEE Computer Security Foundations Workshop, 1996.

	BibTex	x
	@article{ 10.1109/CSFW.1996.503689, author = {J.K. Millen and Hai-Ping Ko}, title = {Narrowing terminates for encryption}, journal ={Computer Security Foundations Workshop, IEEE}, volume = {0}, year = {1996}, issn = {1063-6900}, pages = {39}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSFW.1996.503689}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Security Foundations Workshop, IEEE TI - Narrowing terminates for encryption SN - 1063-6900 SP EP A1 - J.K. Millen, A1 - Hai-Ping Ko, PY - 1996 KW - cryptography; access protocols; encryption; protocol analysis; term replacement rules; reduction properties; symbolic encryption operations; narrowing steps; infinite sequence; popular abstract encryption operators; terminating algorithm VL - 0 JA - Computer Security Foundations Workshop, IEEE ER -

J.K. Millen, Mitre Corp., Bedford, MA, USA

Hai-Ping Ko, Mitre Corp., Bedford, MA, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.1996.503689

Many techniques for protocol analysis use term replacement rules to express the reduction properties of symbolic encryption operations. Some approaches must solve equations in those operators, using sequences of narrowing steps. It is shown that every infinite sequence of narrowing steps for popular abstract encryption operators has a loop, and hence there is a terminating algorithm to solve such equations by searching all sequences of narrowing steps.

Index Terms:

cryptography; access protocols; encryption; protocol analysis; term replacement rules; reduction properties; symbolic encryption operations; narrowing steps; infinite sequence; popular abstract encryption operators; terminating algorithm

Citation:

J.K. Millen, Hai-Ping Ko, "Narrowing terminates for encryption," csfw, pp.39, Ninth IEEE Computer Security Foundations Workshop, 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.