Results 41 to 50 of about 21,314 (180)
Coin Tossing is Strictly Weaker Than Bit Commitment
, 1999 We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditionally
A. Kent +9 more
core +1 more source
A New Algorithm for Solving Ring-LPN with a Reducible Polynomial [PDF]
, 2014 The LPN (Learning Parity with Noise) problem has recently proved to be of great importance in cryptology. A special and very useful case is the RING-LPN problem, which typically provides improved efficiency in the constructed cryptographic primitive.
Guo, Qian +2 more
core +1 more source
Compiling symbolic attacks to protocol implementation tests
, 2012 Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but the feasability of these scenarios need to be confirmed at the ...
Ghabri, Hatem +2 more
core +4 more sources
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
Achieving the physical limits of the bounded-storage model [PDF]
, 2011 Secure two-party cryptography is possible if the adversary's quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the protocol.
Mandayam, Prabha, Wehner, Stephanie
core +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
Cloud-based Quadratic Optimization with Partially Homomorphic Encryption [PDF]
, 2019 The development of large-scale distributed control systems has led to the outsourcing of costly computations to cloud-computing platforms, as well as to concerns about privacy of the collected sensitive data.
Alexandru, Andreea B. +5 more
core +2 more sources
Brain‐Inspired Polymer Dendrite Networks for Morphology‐Dependent Computing Hardware
Advanced Science, Volume 12, Issue 33, September 4, 2025.Although process variability is often perceived as a drawback in electronics, this work harnesses the stochastic nature of electropolymerization as a powerful ally for computation. The resulting conductive polymer dendrites exhibit unique structure‐property relationships and support in memory computing, paving the way for the development of a new class
Corentin Scholaert +3 more
wiley +1 more source
Optimization of Additive Fibonacci Generators Based on Primitive Polynomials Over GF(p)
IEEE AccessThis paper presents an approach to the modification of the additive Fibonacci generator by implementing it based on primitive polynomials over the field GF(p).
Pawel Sawicki +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