Results 21 to 30 of about 235,449 (333)
Journal of the ACM, 2017 We study the possibility of computing cryptographic primitives in a fully black-box arithmetic model over a finite field F . In this model, the input to a cryptographic primitive (e.g., encryption scheme) is given as a sequence of field elements, the honest parties are implemented by arithmetic circuits that make ...
Benny Applebaum +2 more
openaire +2 more sources
IET Information Security, 2023 In the User and Entity Behaviour Analytics (UEBA), unknown malicious behaviours are often difficult to be automatically detected due to the lack of labelled data.
Yi‐feng Wang, Yuan‐bo Guo, Chen Fang
doaj +1 more source
Lattice Enumeration with Discrete Pruning: Improvements, Cost Estimation and Optimal Parameters
Mathematics, 2023 Lattice enumeration is a linear-space algorithm for solving the shortest lattice vector problem (SVP). Extreme pruning is a practical technique for accelerating lattice enumeration, which has a mature theoretical analysis and practical implementation ...
Luan Luan +3 more
doaj +1 more source
Watermarking Is Not Cryptography [PDF]
, 2006 The fields of cryptography and communications are quite distinct and while communications systems often combine technologies from the two fields, a layered architecture is applied that permits each layer to be independently designed. It is generally agreed that watermarking, i.e.
Cox, Ingemar +2 more
openaire +5 more sources
Fault-Tolerant Data Aggregation Scheme Supporting Fine-Grained Linear Operation in Smart Grid
IEEE Access, 2023 Smart grid is a combination of traditional power system engineering and information and communication technology. Smart grid provides users with convenient services through real-time data updates.
Zichao Song +5 more
doaj +1 more source
Acknowledgement to Reviewers of Cryptography in 2018
Cryptography, 2019 Rigorous peer-review is the corner-stone of high-quality academic publishing [...]
Cryptography Editorial Office
doaj +1 more source
Phase-Matching Quantum Key Distribution with Discrete Phase Randomization
Entropy, 2021 The twin-field quantum key distribution (TF-QKD) protocol and its variations have been proposed to overcome the linear Pirandola–Laurenza–Ottaviani–Banchi (PLOB) bound.
Xiaoxu Zhang +6 more
doaj +1 more source
Efficient Unified Arithmetic for Hardware Cryptography [PDF]
, 2008 The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF(q), where q = pk and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1 ...
Koc, Cetin Kaya +3 more
core +2 more sources
Finite-Key Analysis of 1-Decoy Method Quantum Key Distribution with Intensity Fluctuation
Applied Sciences, 2022 The decoy state quantum key distribution (QKD) protocol is proven to be an effective strategy against the photon number splitting attack. It was shown that the 1-decoy state protocol, easier to implement in the practical QKD system, outperforms the 2 ...
Chun Zhou +7 more
doaj +1 more source
Post-Quantum Cryptography [PDF]
Nature, 2011 Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive ...
Daniel J. Bernstein +2 more
openaire +3 more sources