arXiv (All)
open access
BenX: Resource-Sharing Permutations for Computational Integrity
Cryptographic hash functions over integers modulo a prime play a decisive role in the efficiency and security of proof systems for computational integrity. Early designs focused on compact arithmetic circuits and efficient software execution, primarily targeting general-purpose CPUs rather than hard
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- ORCHID: Orchestrated Reduction Consensus for Hash-based Integrity in Distributed Ledgers#178792
- Space/time trade-offs in hash coding with allowable errors#6541
- Security in Computer and Information Sciences#671877
- Location-Independent Data/Software Integrity Protocol#133661
- Computational Certified Deletion Property of Magic Square Game and its Application to Classical Secure Key Leasing#1084056
Record · ID 1105645
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive