Results 101 to 110 of about 4,580 (206)

Whanau: A Sybil-Proof Distributed Hash Table

, 2010
Whānau is a novel routing protocol for distributed hash tables (DHTs) that is efficient and strongly resistant to the Sybil attack. Whānau uses the social connections between users to build routing tables that enable Sybil-resistant lookups.
Kaashoek, M. Frans, Lesniewski-Laas, Christopher Tur   +1 more
core  

Contribution to post-quantum code-based cryptography in rank metric : Hash Proof Systems and lightweight cryptography

, 2021
La conception d’ordinateurs quantiques aura un impact majeur sur la cryptographie que nous utilisons tous les jours pour sécuriser nos communications, en particulier sur la cryptographie dite asymétrique.
Connan, Yann
core  

Elliptic curve cryptography, zero-knowledge proof, and Lamport's hash chain in a distributed authentication system

, 2013
Thesis (M.S.C.S.) PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request.
Chang, Simon Yi-Fan
core  

Validating digital evidence for legal argument

, 2008
Digital evidence is now common in legal cases, but the understanding of the legal fraternity as to how far conventional ideas of evidence can be extended into the digital domain lags behind.
Hobbs, V.J., Boddington, Richard, Mann, G., Mann, Graham, Boddington, R., Hobbs, Valerie   +5 more
core   +1 more source

Poster Sessions

HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

Distributed storage database system for motion data based on blockchain technology

Scientific Reports
As the importance of sports data in health management increases, traditional centralized storage faces security and privacy protection issues. Blockchain technology provides a new solution for the secure storage and sharing of sports data through its ...
Peng Wang, Zhizhi Zhao
doaj   +1 more source

Attacking Split-and-Lookup-Based Primitives Using Probabilistic Polynomial System Solving

IACR Transactions on Symmetric Cryptology
In recent years, many hash functions have been introduced to satisfy the pressing need of some zero-knowledge protocols for such primitives allowing a low degree verification of their round function when arithmetized over a large field.
Antoine Bak, Guilhem Jazeron, Pierre Galissant, Léo Perrin   +3 more
doaj   +1 more source

Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions

Cryptography
Polynomial commitment schemes (PCS) enable a prover to commit to a polynomial and later reveal evaluations with succinct, verifiable proofs. As critical components of modern cryptographic systems like Verkle trees and zk-SNARKs, these methods are ...
Maksim Iavich, Tamari Kuchukhidze, Razvan Bocu   +2 more
doaj   +1 more source

Provable Security of Cryptographic Hash Functions

, 2013
Cryptographic hash functions form the basis of the security of today's digital environment, and find applications in numerous cryptographic systems such as tamper detection, key derivation functions, and digital signatures. Ideally, hash functions behave
Mennink, Bart
core  

Small-field hash-based SNARGs are less sound than conjectured [PDF]

Hash-based succinct non-interactive arguments (SNARGs) are a widely studied and deployed class of proof systems. The security of practical hash-based SNARGs relies on two combinatorial parameters of its underlying linear code $\mathcal{C}$: a distance ...
Giacomo Fenzi, Antonio Sanso
core