Results 171 to 180 of about 5,154 (217)
Some of the next articles are maybe not open access.
Visualization of cryptographic protocols with GRACE
Journal of Visual Languages and Computing, 2008In 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 ...
Giuseppe Cattaneo
exaly +3 more sources
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 +2 more
openaire +1 more source
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 +2 more
openaire +1 more source
Stateless Cryptographic Protocols
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011Secure 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
Vipul Goyal, Hemanta K. Maji
openaire +1 more source
Cryptographic protocols and voting
1994Three protocols related to computer voting are presented. First protocol is an efficient ANDOS protocol which is based on a natural cryptographic assumption. The other two protocols attack a difficult problem in computer voting: buying of votes. We manage to solve this problem but our protocols are impractical in large-scale elections.
Valtteri Niemi, Ari Renvall
openaire +1 more source
Roles in cryptographic protocols
Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy, 2003In 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 +1 more source
Petri nets in cryptographic protocols
Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2005A process language for security protocols is presented together with a semantics in terms of sets of events. The denotation of process is a set of events, and as each event specifies a set of pre and postconditions, this denotation can be viewed as a Petri net.
Crazzolara, Federico, Winskel, Glynn
openaire +2 more sources
Cryptography and cryptographic protocols
Distributed Computing, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fischer's cryptographic protocols
Proceedings of the twenty-second annual symposium on Principles of distributed computing, 2003This note is prepared for Michael Fischer's 60th birthday celebration at PODC 2003. In it, I briefly describe some of Michael Fischer's work on distributed cryptographic protocols.
openaire +1 more source
Abstracting cryptographic protocols
2016Cryptographic protocols can be used to harden the security of IT systems, but only if these protocols are carefully woven into the system. Thus, a security analysis of the overall system is necessary to ensure that the cryptographic protocols are effectively applied. The classical proof technique for computational security proofs (reduction proofs) are,
openaire +2 more sources

