Results 41 to 50 of about 35,941 (264)
Permutable Cut-and-Choose Oblivious Transfer and Its Application
IEEE Access, 2020 Oblivious transfer (OT) is a significant primitive with wide use in secure two-party computation, private set intersection private and other cryptographic schemes.
Xiaochao Wei +3 more
doaj +1 more source
BipBip: A Low-Latency Tweakable Block Cipher with Small Dimensions
Transactions on Cryptographic Hardware and Embedded Systems, 2022 Recently, a memory safety concept called Cryptographic Capability Computing (C3) has been proposed. C3 is the first memory safety mechanism that works without requiring extra storage for metadata and hence, has the potential to significantly enhance the
Yanis Belkheyar +4 more
doaj +1 more source
Statistical assessment – as a part of security assessment applied to a block cipher [PDF]
Revista Română de Statistică, 2016 The security provided by the block cipher algorithms is a top modern approached issue within the specific researches. The security assessment of a block algorithm involves the assessing and testing of components, the statistical testing of algorithm and ...
Ioana Roxana Dragomir, Marilena Lazăr
doaj
A novel systematic byte substitution method to design strong bijective substitution box (S-box) using piece-wise-linear chaotic map [PDF]
PeerJ Computer Science, 2022 Cryptography deals with designing practical mathematical algorithms having the two primitive elements of confusion and diffusion. The security of encrypted data is highly dependent on these two primitive elements and a key.
Asim Ali +3 more
doaj +2 more sources
On the Bit Security of Cryptographic Primitives
, 2018 We introduce a formal quantitative notion of “bit security” for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic function requiring a brute force attack on a k-bit key space.
Micciancio, Daniele, Walter, Michael
openaire +2 more sources
Breaking universal limitations on quantum conference key agreement without quantum memory
Communications Physics, 2023 Quantum conference key agreement is an important cryptographic primitive for future quantum network. Realizing this primitive requires high-brightness and robust multiphoton entanglement sources, which is challenging in experiment and unpractical in ...
Chen-Long Li +7 more
doaj +1 more source
Journal of Mathematical Cryptology, 2020 Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a ...
Crescenzo Giovanni Di +3 more
doaj +1 more source
Robust Combiners and Universal Constructions for Quantum Cryptography [PDF]
arXiv, 2023 A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. Its correctness and security hold as long as one of the original candidates satisfies correctness and security. A universal construction is a closely related notion to a robust combiner. A universal construction for a primitive
arxiv
Remarks on the Cryptographic Primitive of Attribute-based Encryption [PDF]
, 2014 Attribute-based encryption (ABE) which allows users to encrypt and decrypt messages based on user attributes is a type of one-to-many encryption. Unlike the conventional one-to-one encryption which has no intention to exclude any partners of the intended
Cao, Zhengjun, Liu, Lihua
core +1 more source
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