Results 231 to 240 of about 66,162 (284)
RFID Cryptographic Protocol Based on Cyclic Redundancy Check for High Efficiency
, 2015 Nian Liu, Yin Ye, Xiangnong Wu, Long Ye
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Visualization of cryptographic protocols with GRACE
Journal of Visual Languages & 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 ...
CATTANEO, Giuseppe +2 more
openaire +2 more sources
2017
This chapter is concerned with cryptographic protocols. We begin with an explanation of what components a cryptographic protocol consists of. We then illustrate the complexity of designing a secure cryptographic protocol by considering an artificially simple scenario, for which we propose and analyse seven candidate protocols.
openaire +1 more source
This chapter is concerned with cryptographic protocols. We begin with an explanation of what components a cryptographic protocol consists of. We then illustrate the complexity of designing a secure cryptographic protocol by considering an artificially simple scenario, for which we propose and analyse seven candidate protocols.
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
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
Delayed-Input Cryptographic Protocols
2017The 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 +2 more sources