Results 231 to 240 of about 63,614 (274)

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

Background of Cryptographic Protocols

2012
Some background knowledge including preliminary knowledge, cryptographic primitive knowledge, cryptographic protocol knowledge, cryptographic protocol security knowledge, and communication threat model knowledge are briefly introduced.
Kefei Chen, Ling Dong
openaire   +2 more sources

Fischer's cryptographic protocols

Proceedings of the twenty-second annual symposium on Principles of distributed computing, 2003
This 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   +2 more sources

Cryptographic protocols and voting

1994
Three 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   +2 more sources

Cryptography and cryptographic protocols

Distributed Computing, 2003
We survey the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. We start by presenting some of the central tools (e.g., computational difficulty, pseudorandomness, and zero-knowledge proofs), and next turn to the treatment of encryption and signature schemes.
openaire   +2 more sources

Probabilistic Termination and Composability of Cryptographic Protocols

Journal of Cryptology, 2016
When analyzing the round complexity of multi-party computation MPC, one often overlooks the fact that underlying resources, such as a broadcast channel, can by themselves be expensive to implement. For example, it is impossible to implement a broadcast channel by a deterministic protocol in a sub-linear in the number of corrupted parties number of ...
Cohen, Ran, Coretti, Sandro, Garay, Jüan A., Zikas, Vassilis   +3 more
openaire   +5 more sources