Results 71 to 80 of about 3,018,405 (324)
, 1999 We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares contains ...
A. Karlsson +23 more
core +1 more source
Advanced Energy and Sustainability Research, EarlyView.Hydrogen‐powered aviation offers a transformative pathway to zero‐emission flight by eliminating in‐flight CO2 emissions. Key considerations include propulsion systems (fuel cells and hydrogen combustion), cryogenic storage and insulation challenges, infrastructure and cost barriers, and supply‐chain constraints.
Mubasshira +4 more
wiley +1 more source
Circular quantum secret sharing
, 2006 A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three.
Bennett C H Brassard G +17 more
core +1 more source
Agribusiness, EarlyView.ABSTRACT Vending is an important sector in the daily lives of many people, and coffee is the most frequently consumed product in the European market. Like many other sectors, vending is responding to the challenge of sustainable development by taking various actions, such as offering increasingly ecologically sound coffee while maintaining/improving ...
Alberto Bertossi +2 more
wiley +1 more source
Journal of Mathematical Cryptology, 2013 An n-player -secure robust secret sharing scheme is a (t,n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least , from the set of all shares even if up to t players provide incorrect ...
Jhanwar Mahabir P. +1 more
doaj +1 more source
Some Multisecret-Sharing Schemes over Finite Fields
Mathematics, 2020 A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot.
Selda Çalkavur, Patrick Solé
doaj +1 more source
A CRDNet‐Based Watermarking Algorithm for Fused Visible–Infrared Images
Advanced Intelligent Systems, EarlyView.CRDnet includes encoders and decoders based on residual and dense structures, a fusion network robust to 12 visible and infrared image fusion algorithms, and predictors for predicting watermarked infrared images. The encoder and decoder incorporate preprocessing steps, attention mechanisms, and activation functions suitable for infrared images.
Yu Bai +4 more
wiley +1 more source
Fair Verifiable Secret Sharing Driven by Smart Contracts [PDF]
Jisuanji gongchengUnfair issues arise in secret sharing owing to the insufficient consideration given to participants′self-interested behaviors, such as honest participants being unable to reconstruct the shared secret while dishonest participants are able to.
ZHANG Qianhui, YUAN Lingyun, XIE Tianyu, WU Jiaying
doaj +1 more source
An ideal multi-secret sharing scheme based on minimal privileged coalitions [PDF]
, 2012 How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In this paper, we solve an open problem proposed by Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342], namely to design an ...
Li, Zhihui, Song, Yun
core +1 more source
Early synapsids neurosensory diversity revealed by CT and synchrotron scanning
The Anatomical Record, EarlyView.Abstract Non‐mammaliaform synapsids (NMS) represent the closest relatives of today's mammals among the early amniotes. Exploring their brain and nervous system is key to understanding how mammals evolved. Here, using CT and Synchrotron scanning, we document for the first time three extreme cases of neurosensory and behavioral adaptations that probe ...
J. Benoit +6 more
wiley +1 more source