Results 51 to 60 of about 27,079 (283)
Efficient inner product arguments and their applications in range proofs
IET Information Security, 2023 Inner product arguments allow a prover to prove that the inner product of two committed vectors equals a public scalar. They are used to reduce the complexity of many cryptographic primitives, such as range proofs.
Zibo Zhou +4 more
doaj +1 more source
Bit commitment from weak non-locality [PDF]
IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005., 2005 This paper has been withdrawn by the authors.
Stefan Wolf 0001, Jürg Wullschleger
openaire +2 more sources
Secure Modulation Based on Constellation Mapping Obfuscation in OFDM Based TDD Systems
IEEE Access, 2020 In this paper, we propose a secure modulation technique based on constellation mapping obfuscation to harden computational complexity for security at the physical-layer.
Inkyu Bang, Taehoon Kim
doaj +1 more source
UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence [PDF]
Scientific Annals of Computer Science, 2013 Based on tamper-evident devices, i.e., a type of distinguishable, sealed envelopes, we put forward weak bit-commitment protocols which are UC-secure. These commitments are weak in that it is legitimate that a party could cheat.
I. Boureanu, S. Vaudenay
doaj +1 more source
Unconditionally secure quantum coin flipping
Results in Physics, 2023 Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible.
Guang Ping He
doaj +1 more source
A First Step to the Categorical Logic of Quantum Programs
Entropy, 2020 The long-term goal of our research is to develop a powerful quantum logic which is useful in the formal verification of quantum programs and protocols.
Xin Sun, Feifei He
doaj +1 more source
Security details for bit commitment by transmitting measurement outcomes [PDF]
, 2012 We give details of a simple argument for a security bound for a recently published secure relativistic quantum bit commitment ...
Croke, S., Kent, A.
core +1 more source
Unconditionally secure quantum bit commitment: Revised [PDF]
, 2020 Bit commitment is a primitive task of many cryptographic tasks. It has been proved that the unconditionally secure quantum bit commitment is impossible from Mayers-Lo-Chau No-go theorem.
Xiaojun Wang, Ming-Xing Luo
core
Unconditionally Secure Quantum Bit Commitment and Quantum Oblivious Transfer [PDF]
, 2023 Recently, a novel secure quantum bit commitment (QBC) protocol has been proposed [29]. However, the protocol requires Alice and Bob to share Bell states in advance, making the protocol lacking in practicality.
Yiting Su, Ping Wang, Yikang Lei
core
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source