On the security of name-stamp protocols

DOI10.1016/0304-3975(85)90146-XMaRDI QIDQ1071729zbMATH OpenWikidataFDO

Authors Ronald V. Book, Friedrich Otto

Publication date 1985

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(85)90146-X

zbMATH Keywords

network communicationpublic key cryptography

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Communication, information (94A99)

Review text

Protocols are of great importance to public key cryptography in order to prevent active saboteurs. Whereas in the construction of cascade protocols only encryption functions and decryption functions are used, additional types of functions occur in the construction of name stamp protocols: name appending functions, name matching functions and a deletion function. \textit{D. Dolev} and \textit{A. C. Yao} defined a notion of security of protocols [IEEE Trans. Inf. Theory IT-29, 198-208 (1983; Zbl 0502.94005)] and developed a characterization of two-party cascade protocols that are secure. In the present paper it is shown that there is no similar characterization of name stamp protocols that are secure.

Recommendations

• On the security of p-party protocols
• The Verifiability of Two-Party Protocols
• On the verifiability of two-party algebraic protocols
• On the security of public key protocols
• scientific article; zbMATH DE number 3965967

Cites work

• Cancellation rules and extended word problems
• On the security of ping-pong protocols
• On the security of public key protocols
• On the verifiability of two-party algebraic protocols

Cited in

(3)

• On the verifiability of two-party algebraic protocols
• On the security of p-party protocols
• The Verifiability of Two-Party Protocols

This page was built for publication: On the security of name-stamp protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071729)