Results 11 to 20 of about 4,580 (206)
Removing Erasures with Explainable Hash Proof Systems [PDF]
An important problem in secure multi-party computation is the design of protocols that can tolerate adversaries that are capable of corrupting parties dynamically and learning their internal states. In this paper, we make significant progress in this area in the context of password-authenticated key exchange (PAKE) and oblivious transfer (OT) protocols.
Michel Abdalla +2 more
core +6 more sources
Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations [PDF]
ECDSA is a widely adopted digital signature standard. Unfortunately, efficient distributed variants of this primitive are notoriously hard to achieve and known solutions often require expensive zero knowledge proofs to deal with malicious adversaries.
Castagnos, Guilhem +4 more
openaire +5 more sources
A Lightweight RFID Grouping-Proof Protocol Based on Parallel Mode and DHCP Mechanism
A Radio Frequency Identification (RFID) grouping-proof protocol is to generate an evidence of the simultaneous existence of a group of tags and it has been applied to many different fields.
Zhicai Shi, Xiaomei Zhang, Yihan Wang
doaj +2 more sources
Permutation-Based Hash Chains with Application to Password Hashing
Hash chain based password systems are a useful way to guarantee authentication with one-time passwords. The core idea dates back to Lamport, and is specified in RFC 1760 as S/Key. At CCS 2017, Kogan et al.
Charlotte Lefevre, Bart Mennink
doaj +3 more sources
Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan +7 more
wiley +1 more source
Generalized (identity‐based) hash proof system and its applications [PDF]
AbstractIn this work, we generalize the paradigm of the hash proof system (HPS) proposed by Cramer and Shoup (EUROCRYPT 2002). In the center of our generalization, we lift a subset membership problem to a distribution‐distinguishing problem. Our generalized HPS clarifies and encompasses all the known public‐key encryption (PKE) schemes that essentially
Yu Chen 0003 +3 more
openaire +2 more sources
Thread-local, step-local proof obligations for refinement of state-based concurrent systems [PDF]
This paper presents a proof technique for proving refinements for general state-based models of concurrent systems that reduces proving forward simulations to thread-local, step-local proof obligations.
Reif, Wolfgang +2 more
core +1 more source
Cryptographic Puzzles and Complex Systems
A puzzle lies behind password authentication (PA) and blockchain proof of work (PoW). A cryptographic hash function is commonly used to implement them. The potential problem with secure hash functions is their complexity and rigidity.
Vuckovac, Rade
core +1 more source
Poseidon: A New Hash Function for Zero-Knowledge Proof Systems [PDF]
The area of practical computational integrity proof systems, like SNARKs, STARKs, Bulletproofs, is seeing a very dynamic development with several constructions having appeared recently with improved properties and relaxed setup requirements.
Arnab Roy +4 more
core
Hybrid Consensus Algorithm Based on Modified Proof-of-Probability and DPoS
As the core of blockchain technology, the consensus algorithm plays an important role in determining the security, data consistency, and efficiency of blockchain systems. The existing mainstream consensus algorithm is experiencing difficulties satisfying
Baocheng Wang, Zetao Li, Haibin Li
doaj +1 more source

