Results 141 to 150 of about 62,745 (179)

Cryptographic protocols

Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982
A cryptographic transformation is a mapping f from a set of cleartext messages, M, to a set of ciphertext messages. Since for m e M, f(m) should hide the contents of m from an enemy, f-1 should, in a certain technical sense, be difficult to infer from f(m) and public knowledge about f.
Richard A. DeMillo, Michael Merritt, Nancy Lynch   +2 more
openaire   +2 more sources

Visualization of cryptographic protocols with GRACE

Journal of Visual Languages & Computing, 2008
In this paper we present GRACE (graphical representation and animation for cryptography education), a Java-based educational tool that can be used to help in teaching and understanding of cryptographic protocols. The tool adopts an active learning model that engages the learner by asking him to describe, in an exemplification of a real-world scenario ...
CATTANEO, Giuseppe, DE SANTIS, Alfredo, Umberto Ferraro Petrillo   +2 more
openaire   +3 more sources

Verifiable Verification in Cryptographic Protocols

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023
Common verification steps in cryptographic protocols, such as signature or message authentication code checks or the validation of elliptic curve points, are crucial for the overall security of the protocol. Yet implementation errors omitting these steps easily remain unnoticed, as often the protocol will function perfectly anyways.
Marc Fischlin, Felix Günther
openaire   +1 more source

Stateless Cryptographic Protocols

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Secure computation protocols inherently involve multiple rounds of interaction among the parties where, typically a party has to keep a state about what has happened in the protocol so far and then \emph{wait} for the other party to respond. We study if this is inherent. In particular, we study the possibility of designing cryptographic protocols where
Hemanta K. Maji, Vipul Goyal
openaire   +2 more sources

Roles in cryptographic protocols

Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy, 2003
In protocols for the distribution of symmetric keys, a principal will usually either take on the role as a session key provider or as a session key user. A principal taking on the role as session key user may also act as the master or the slave.
openaire   +2 more sources

Introduction of Cryptographic Protocols

2012
Cryptographic protocols are communication protocols which are designed to provide security assurances of various kinds, using cryptographic mechanisms. This chapter gives a brief introduction of cryptographic protocols and the reason why we study these protocols.
Ling Dong, Kefei Chen
openaire   +2 more sources

Delayed-Input Cryptographic Protocols

2017
The delayed-input witness-indistinguishable proof of knowledge of Lapidot and Shamir (LS) [CRYPTO 1989] is a powerful tool for designing round-efficient cryptographic protocols. Since LS was designed for the language of Hamiltonian graphs, when used as subprotocol it usually requires expensive NP reductions.
openaire   +3 more sources