Results 201 to 210 of about 7,441 (248)

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

Cryptographic Voting Protocols

2018
Most 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, Jayanthi Mathanan   +1 more
openaire   +1 more source

Distributed cryptographic function application protocols

1997
Recovery 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

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   +1 more source

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   +1 more source

Abstracting cryptographic protocols

2016
Cryptographic 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   +1 more source

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.
Ling Dong, Kefei Chen
openaire   +1 more source

Evaluating Cryptographic Protocols

1993
Cryptographic Protocol (CP) analysis is a topic of intense research. Meadows describes four approaches for CP verification under investigation in [MEA92] and several authors have categorized protocols based on types of errors they are subject to [BIRD92], [SYV93a],[SYV93b].
openaire   +1 more source

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   +1 more source

Cryptographic protocols

2002
Hans Delfs, Helmut Knebl
openaire   +2 more sources