ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Bit-sharing”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CRMay 6, 2026

Probabilistic Atomic Swaps for Bitcoin and Friends

Paul Gerhart, Jay Taylor, Sri Aravinda Krishnan Thyagarajan

The paper introduces probabilistic swaps, a new cryptographic primitive that extends traditional atomic swaps to enable trustless, randomized exchanges with verifiable, fixed probabilities.

View →
cs.CRRecentJun 1, 2026

Unicity: Predicates and Atomic Swaps

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.

View →
cs.CRRecentJun 1, 2026

The Unicity Execution Layer

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.

View →
cs.CRcs.AREmpiricalRecentJun 10, 2026

Partitioned Tags, Shared Data: Reconciling Strict Cache Isolation with Write-Shared Coherence

Kartik Ramkrishnan, Stephen McCamant, Antonia Zhai, Pen Chung Yew

This paper presents SCP, a cache partitioning design that combines strict eviction isolation with write-shared coherence to mitigate eviction-based cache side channels.

View →
cs.CRcs.SEApr 30, 2026

zkSBOM: Privacy-Preserving SBOM Sharing with Zero-Knowledge Sets

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…

View →
cs.DCcs.CRTheoreticalRecentJul 23, 2026

The Consensus Number of Untraceable Cryptocurrencies

Christian Cachin, David Lehnherr, Juan Villacis, François-Xavier Wicht

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…

View →
cs.DSTheoreticalRecentJul 20, 2026

Linear Probing with Non-Greedy Insertions

Andrew Krapivin, William Kuszmaul, Jolyne Wang

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).

View →
cs.DCcs.DSTheoreticalRecentJun 15, 2026

Space-Efficient Lock-Free Linear-Probing Hash Table

Hagit Attiya, Rotem Oshman, Noa Schiller

This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.

View →
cs.ITTheoreticalRecentOct 9, 2026

Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files

Tati V D N Eswar, Jithin Ravi

The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.

View →
cs.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

View →
cs.CRcs.ITMar 23, 2026

Asymptotically Ideal Hierarchical Secret Sharing Based on CRT for Integer Ring

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…

View →
cs.CCquant-phTheoreticalRecentOct 24, 2026

Communication Complexity of Integer Matrix Singularity

Chengu Wang

This paper provides quantum lower and upper bounds for testing singularity of matrices and their bitwise XOR over the rationals.

View →
cs.CRcs.DCMar 24, 2026

n-VM: A Multi-VM Layer-1 Architecture with Shared Identity and Token State

Jian Sheng Wang

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.

View →
cs.CRcs.DCcs.NIMar 30, 2026

BitSov: A Composable Bitcoin-Native Architecture for Sovereign Internet Infrastructure

Oliver Aleksander Larsen, Rasmus Thorsen Larsen, Mahyar T. Moghaddam

The paper proposes BitSov, an eight-layer, Bitcoin-native architectural framework designed to build sovereign internet infrastructure by composing existing decentralized technologies.

View →
cs.ITmath.COEmpiricalRecentAug 14, 2026

New lower bounds for constant-weight codes via seeded bit-swap tabu search

William Echols

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.

View →
cs.CRMar 18, 2026

DDH-based schemes for multi-party Function Secret Sharing

Marc Damie, Florian Hahn, Andreas Peter, Jan Ramon

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…

View →
cs.CRRecentMay 28, 2026

Scarcity Is Not Enough: An Impossibility Result for Linear Sybil Cost Under Parallelizable Resources

Homayoun Maleki, Nekane Sainz, Jon Legarda, Igor Santos-Grueiro

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…

View →
cs.CRcs.ITMar 23, 2026

Asymptotically Ideal Conjunctive Hierarchical Secret Sharing Scheme Based on CRT for Polynomial Ring

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…

View →
cs.CRcs.FLMar 20, 2026

Sharing The Secret: Distributed Privacy-Preserving Monitoring

Mahyar Karimi, K. S. Thejaswini, Roderick Bloem, Thomas A. Henzinger

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…

View →