Results 41 to 50 of about 384,292 (296)
Quantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography [PDF]
, 2014 We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness - guaranteeing that honest players obtain their correct outcomes only - we can show that every strictly correct quantum protocol implementing ...
Salvail, Louis +2 more
core +2 more sources
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We give a protocol for producing certifiable randomness from a single untrusted quantum device that is polynomial-time bounded. The randomness is certified to be statistically close to uniform from the point of view of any computationally unbounded ...
Zvika Brakerski +4 more
semanticscholar +1 more source
, 2012 Most of today’s cryptographic primitives are based on computations that are hard to perform for a potential attacker but easy to perform for somebody who is in possession of some secret information, the key, that opens a back door in these hard ...
Niederhagen, R.F.
core +3 more sources
Xoodyak, a lightweight cryptographic scheme
IACR Transactions on Symmetric Cryptology, 2020 In this paper, we present Xoodyak, a cryptographic primitive that can be used for hashing, encryption, MAC computation and authenticated encryption. Essentially, it is a duplex object extended with an interface that allows absorbing strings of arbitrary ...
J. Daemen +4 more
semanticscholar +1 more source
Key Assignment Scheme with Authenticated Encryption
IACR Transactions on Symmetric Cryptology, 2018 The Key Assignment Scheme (KAS) is a well-studied cryptographic primitive used for hierarchical access control (HAC) in a multilevel organisation where the classes of people with higher privileges can access files of those with lower ones.
Suyash Kandele, Souradyuti Paul
doaj +1 more source
APTE: An Algorithm for Proving Trace Equivalence [PDF]
, 2014 This paper presents APTE, a new tool for automatically proving the security of cryptographic protocols. It focuses on proving trace equivalence between processes, which is crucial for specifying privacy type properties such as anonymity and unlinkability.
B. Blanchet +5 more
core +1 more source
Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
IACR Transactions on Symmetric Cryptology, 2018 Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this
Joan Daemen +2 more
doaj +1 more source
Implementation and Optimization of Zero-Knowledge Proof Circuit Based on Hash Function SM3
Sensors, 2022 With the increasing demand for privacy protection in the blockchain, the universal zero-knowledge proof protocol has been developed and widely used. Because hash function is an important cryptographic primitive in a blockchain, the zero-knowledge proof ...
Yang Yang +7 more
doaj +1 more source
Uncloneable Cryptographic Primitives with Interaction
, 2023 44 pages, 3 ...
Broadbent, Anne, Culf, Eric
openaire +2 more sources
Automatically eliminating speculative leaks from cryptographic code with blade
Proc. ACM Program. Lang., 2020 We introduce Blade, a new approach to automatically and efficiently eliminate speculative leaks from cryptographic code. Blade is built on the insight that to stop leaks via speculative execution, it suffices to cut the dataflow from expressions that ...
Marco Vassena +7 more
semanticscholar +1 more source