20 results for “Bit-sharing”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper introduces probabilistic swaps, a new cryptographic primitive that extends traditional atomic swaps to enable trustless, randomized exchanges with verifiable, fixed probabilities.
Ahto Buldas, Dirk Draheim, Mike Gault, Risto Laanoja +2 more
The paper generalizes Unicity token ownership using programmable spending conditions called predicates, enabling trustless atomic swaps and smart-contract-like functionality executed off-chain.
Ahto Buldas, Dirk Draheim, Mike Gault, Risto Laanoja +2 more
The paper introduces the Unicity Execution Layer, a secure, modular component that enables trustless off-chain transactions while guaranteeing double-spending prevention and enhancing user privacy.
This paper presents SCP, a cache partitioning design that combines strict eviction isolation with write-shared coherence to mitigate eviction-based cache side channels.
Tom Sorger, Eric Cornelissen, Aman Sharma, Javier Ron +2 more
zkSBOM introduces a zero-knowledge mechanism for sharing Software Bills of Materials (SBOMs) that allows consumers to check for vulnerabilities without suppliers revealing the full, sensitive contents…
This paper compares two cryptocurrency sender untraceability designs, Linear Untraceable Asset Transfer Objects (LUAT) and Constant-State Untraceable Asset Transfer Objects (CUAT), and analyzes their…
This paper proposes a non-greedy insertion strategy for linear probing hash tables, improving worst-case expected insertion time from Θ(x^2) to O(x log x).
This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.
The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.
This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.
Jian Ding, Cheng Wang, Hongju Li, Cheng Shu +1 more
The paper proposes two new asymptotically ideal and secure Hierarchical Secret Sharing (HSS) schemes, disjunctive and conjunctive, utilizing the Chinese Remainder Theorem (CRT) over an integer ring an…
This paper provides quantum lower and upper bounds for testing singularity of matrices and their bitwise XOR over the rationals.
The paper proposes n-VM, a novel Layer-1 architecture that unifies multiple heterogeneous virtual machines (VMs) onto a shared consensus and state layer, solving cross-chain fragmentation issues.
The paper proposes BitSov, an eight-layer, Bitcoin-native architectural framework designed to build sovereign internet infrastructure by composing existing decentralized technologies.
The paper uses seeded initialization with bit-swap tabu search to find new constructions for binary constant-weight codes, improving existing lower bounds and corollary kissing numbers.
The paper proposes a new DDH-based technique that significantly reduces the key size of multi-party Distributed Point Function (DPF) secret sharing schemes, achieving an $O( oot{3}{N})$ key size for h…
The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…
Jian Ding, Cheng Wang, Hongju Li, Cheng Shu +1 more
The paper introduces a novel, asymptotically ideal Conjunctive Hierarchical Secret Sharing (CHSS) scheme using the Chinese Remainder Theorem (CRT) for polynomial rings, achieving high security and an…
The paper proposes a distributed, privacy-preserving monitoring architecture that uses secret-sharing to efficiently monitor systems with continuous state, overcoming the scalability issues of traditi…