搜索结果: 1-15 共查到“密码学 Cryptographic Protocols”相关记录20条 . 查询时间(0.14 秒)
Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution)
Vision Rescue Marvellous
2019/4/28
While common symmetric primitives like the AES and SHA3 are optimized for efficient hardware and software implementations, a range of emerging applications using advanced cryptographic protocols such ...
The necessary conditions for SETUP implementation are building in entropy source (otherwise generated secret will be predictable). In this article, it's considered subscriber whose protocol implementa...
Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks
public-key private-key
2017/10/10
We put forward the notion of self-guarding cryptographic protocols as a countermeasure to algorithm substitution attacks. Such self-guarding protocols can prevent undesirable leakage by subverted algo...
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
secure multi-party computation parallel composition broadcast
2017/4/27
An important benchmark for multi-party computation protocols (MPC) is their round complexity. For several important MPC tasks, (tight) lower bounds on the round complexity are known. However, for some...
Probabilistic Termination and Composability of Cryptographic Protocols
probabilistic termination Universal Composition cryptographic protocol
2016/4/6
When analyzing the round complexity of multi-party cryptographic protocols, one often overlooks the fact that underlying resources, such as a broadcast channel, can be by themselves expensive to imple...
Efficiency Evaluation of Cryptographic Protocols for Boardroom Voting
applications electronic voting
2015/12/29
Efficiency is the bottleneck of many cryptographic protocols
towards their practical application in different contexts. This holds true
also in the context of electronic voting, where cryptographic ...
Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial
role in the development of modern cryptography. The extensive theory of these protocols, however...
Card-based Cryptographic Protocols Using a Minimal Number of Cards
Card-based protocols Committed format Boolean AND
2015/12/23
Secure multiparty computation can be done with a deck of playing cards. For example, den Boer (EUROCRYPT ’89) devised his famous “five-card trick”, which is a secure two-party AND protocol using five ...
Superposition Attacks on Cryptographic Protocols
cryptographic protocols / quantum protocols superposition attacks
2012/3/27
Attacks on cryptographic protocols are usually modeled by allowing an adversary to ask queries to an oracle. Security is then defined by requiring that as long as the queries satisfy some constraint, ...
Sequential Rationality in Cryptographic Protocols
rational cryptography Nash equilibrium subgame perfect equilibrium sequential rationality cryptographic protocols correlated equilibrium
2010/8/24
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationally-bounded players and the asympt...
Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols
cryptographic protocols formal methods first order logic computational semantics
2010/2/20
We present a computationally sound first-order system
for security-analysis of protocols that places secrecy of
nonces and keys in its center. Even trace properties such
as agreement and authentica...
A Principle for Cryptographic Protocols Beyond Security，Less Parameters
Cryptographic Protocols Security Less Parameters
2010/2/1
Almost cryptographic protocols are presented with security arguments.
None of them, however, did explain why a protocol should like this, not like that. The
reason of the phenomenon is that there ar...
On Cryptographic Protocols Employing Asymmetric Pairings -- The Role of $\Psi$ Revisited
Cryptographic Protocols Asymmetric Pairings
2009/10/9
Asymmetric pairingse: G1 ×G2 ! GT for which an efficiently-computable
isomorphism: G2 ! G1 is known are called Type 2 pairings; if such an isomorphism
is not known then e is called a Type 3 pairin...
The Evolution of Cryptographic Protocols in Electronic Passports
Biometrics ePassports RFID
2009/6/12
Electronic Passports are identification documents used primarily for border secu-
rity. They are capable of storing data, performing low cost computations, and communicating
wirelessly. Since 2006, ...
We live in time of computers and scientific and technological progress but this time is
also marked with many attacks on big Internet companies. So with expand of Internet people
start to protect in...