Results 201 to 210 of about 65,060 (255)
Verifying Cryptographic ProtocolsSome 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
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
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
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
Cryptographic Voting Protocols
2018Most of the voting protocols proposed so far can be categorized into two main types based on the approach taken: schemes using blind signatures and schemes using homomorphic encryption. In the schemes using blind signatures, the voter initially obtains a token – a blindly signed message unknown to anyone except himself. In the schemes using homomorphic
Kannan Balasubramanian +1 more
openaire +1 more source
Distributed cryptographic function application protocols
1997Recovery of data stored in a fault-tolerant and secure way requires encryption and / or decryption of data with secret cryptographic functions, for which a group of processors should be responsible. For this purpose, the here-introduced distributed cryptographic function application protocols (DCFAPs) can be applied. DCFAPs are executed on a set, N, of
Postma, A., Krol, Th., Molenkamp, E.
openaire +1 more source