Results 31 to 40 of about 62,745 (179)
Automated Cryptographic Analysis of the Pedersen Commitment Scheme
, 2017 Aiming for strong security assurance, recently there has been an increasing interest in formal verification of cryptographic constructions. This paper presents a mechanised formal verification of the popular Pedersen commitment protocol, proving its ...
Dong, Changyu, Metere, Roberto
core +1 more source
Abstracting cryptographic protocols with tree automata [PDF]
Science of Computer Programming, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Monniaux, David Monniaux
openaire +3 more sources
Anonymous credit cards and their collusion analysis [PDF]
, 1996 Communications networks are traditionally used to bring information together. They can also be used to keep information apart in order to protect personal privacy.
Low, Steven H. +2 more
core +3 more sources
The Practice of Cryptographic Protocol Verification
Electronic Notes in Theoretical Computer Science, 2003 We analyze the complexity of verifying security protocols for finite ...
openaire +3 more sources
On Some Cryptographic Protocol
Schedae Informaticae, 2021 In this paper we present a cryptographic protocol for a seller - buyer problem and in particular we prove that non-emptiness of a semi-commutative set defined by mappings involved in the protocol is a decidable problem.
openaire +3 more sources
Staging quantum cryptography with chocolate balls
, 2005 Moderated by a director, laymen and students are encouraged to assume the role of quanta and enact a quantum cryptographic protocol. The performance is based on a generalized urn model capable of reproducing complementarity even for classical chocolate ...
Svozil, Karl
core +1 more source
Quantum Emitters in Hexagonal Boron Nitride: Principles, Engineering and Applications
Advanced Functional Materials, EarlyView.Quantum emitters in hexagonal boron nitride have emerged as a promising candidate for quantum information science. This review examines the fundamentals of these quantum emitters, including their level structures, defect engineering, and their possible chemical structures.
Thi Ngoc Anh Mai +8 more
wiley +1 more source
Post Quantum Cryptography from Mutant Prime Knots
, 2010 By resorting to basic features of topological knot theory we propose a (classical) cryptographic protocol based on the `difficulty' of decomposing complex knots generated as connected sums of prime knots and their mutants.
Adams C. +13 more
core +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
A bisimulation method for cryptographic protocols [PDF]
, 1998 Summary: We introduce a definition of bisimulation for cryptographic protocols. The definition includes a simple and precise model of the knowledge of the environment with which a protocol interacts. Bisimulation is the basis of an effective proof technique, which yields proofs of classical security properties of protocols and also justifies certain ...
Andrew D. Gordon, Martín Abadi
openaire +3 more sources