Results 91 to 100 of about 375,459 (282)
CommTLC: An Alternative to Reduce the Attack Surface of HTLCs in Lightning Networks
IET Blockchain, Volume 5, Issue 1, January/December 2025.The CommTLC scheme is secure against Fakey, Griefing and Wormhole attacks, as proven using the universal composability framework. It detects adversaries in these attacks within 112 ms for a payment path involving five users. Additionally, it outperforms recent privacy‐preserving PCN‐based solutions, MAPPCN‐OR and EAMHL+, in terms of communication and ...
Prerna Arote, Joy Kuri
wiley +1 more source
Notions of Reducibility between Cryptographic Primitives [PDF]
, 2004 Starting with the seminal paper of Impagliazzo and Rudich [17], there has been a large body of work showing that various cryptographic primitives cannot be reduced to each other via “black-box” reductions. The common interpretation of these results is that there are inherent limitations in using a primitive as a black box, and that these impossibility ...
Salil Vadhan +2 more
openaire +1 more source
IET Cyber-Physical Systems: Theory &Applications, Volume 10, Issue 1, January/December 2025.A cookie contains a session ID that is a unique number generated by the server. The proposed generator is suitable for all types of web applications, because it requires the smallest area of only 134 Gate Equivalent (GE) on the application specific integrated circuit (ASIC) for its execution.
Kavita Bhatia +3 more
wiley +1 more source
Efficient Length Doubling From Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2017 We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n − 1].
Yu Long Chen +3 more
doaj +1 more source
Energy-efficient cryptographic primitives
Facta universitatis - series: Electronics and Energetics, 2018 Our society greatly depends on services and applications provided by mobile communication networks. As billions of people and devices become connected, it becomes increasingly important to guarantee security of interactions of all players. In this talk we address several aspects of this important, many-folded problem.
openaire +3 more sources
ZnO‐based memristor for random number generator: The case of current compliance
Electronics Letters, Volume 61, Issue 1, January/December 2025.The programmability of endurance characteristics of a memristor could realise multipurpose circuits, such as data storage‐random number generator dual applications, that could pave the way for more efficient reconfigurable system designs. Abstract This study aims to exploit the resistance states of Cr/ZnO/TiN memristors to generate random numbers.
Zohreh Hajiabadi +9 more
wiley +1 more source
On Bitcoin Security in the Presence of Broken Cryptographic Primitives [PDF]
, 2016 Digital currencies like Bitcoin rely on cryptographic primitives to operate. However, past experience shows that cryptographic primitives do not last forever: increased computational power and advanced cryptanalysis cause primitives to break frequently, and motivate the development of new ones.
Giechaskiel, I, Cremers, C, Rasmussen, K
openaire +2 more sources
Pseudo-free families and cryptographic primitives
Journal of Mathematical Cryptology, 2022 Abstract In this article, we study the connections between pseudo-free families of computational Ω \Omega -algebras (in appropriate varieties of
openaire +2 more sources
Design and Analysis of a True Random Number Generator Based on GSR Signals for Body Sensor Networks
Sensors, 2019 Today, medical equipment or general-purpose devices such as smart-watches or smart-textiles can acquire a person’s vital signs. Regardless of the type of device and its purpose, they are all equipped with one or more sensors and often have wireless
Carmen Camara +3 more
doaj +1 more source
Verifiable Random Functions (VRFs) [PDF]
, 2018 A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash.
Goldberg, Sharon +3 more
core