Results 231 to 240 of about 1,801,560 (284)

Efficient Card-Based Cryptographic Protocols for the Millionaires' Problem Using Private Input Operations

Asia Joint Conference on Information Security, 2018
This paper proposes new efficient card-based cryptographic protocols for the millionaires' problem using private input operations. The millionaires' problem is one of the fundamental problems in cryptography.
Hibiki Ono, Yoshifumi Manabe
semanticscholar   +1 more source

Computational Model of Card-Based Cryptographic Protocols and Its Applications

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2017
SUMMARY Card-based protocols enable us to easily perform crypto-graphictaskssuchassecuremultipartycomputationusingadeckofphysicalcards.Sincethefirstcard-basedprotocolappearedin1989,manyprotocolshavebeendesigned.Aprotocolisusuallydescribedwithaseriesofsome-
T. Mizuki, Hiroki Shizuya
semanticscholar   +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   +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

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

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

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

Blockchain Consensus Protocols in the Wild

International Symposium on Distributed Computing, 2017
A blockchain is a distributed ledger for recording transactions, maintained by many nodes without central authority through a distributed cryptographic protocol.
C. Cachin, M. Vukolic
semanticscholar   +1 more source