Follow blockchain research across journals, conferences, and preprint repositories.
8,502 results · page 125 of 355
Yuxuan He, Chunqiang Hu, Bin Cai, Xiaoshuang Xing
No abstract is available for this record.
Dixa Hardik Koradia, Vikram Agrawal
No abstract is available for this record.
David (Daoud) Matta
Digital identity has become one of the most pressing governance challenges of the 21st century. This paper argues that digital identity is not optional but inevitable, driven by four converging forces: privacy leakage, AI synthesis, corporate capture, and geopolitical vulnerability. Drawing on political philosophy (Rousseau, Rawls, Foucault, Habermas), comparative case analysis (Estonia, India, China), and emerging technical frameworks (zero-knowledge proofs, decentralized identity), the paper analyzes the opportunities and perils of digital ID systems. It proposes a Digital Social Contract as the normative and institutional framework for governing them. The paper concludes that the decisive question is not whether digital IDs will exist, but how they will be governed — and that only a robust Digital Social Contract, grounded in democratic legitimacy, institutional accountability, and adaptive governance, can ensure that digital identity serves citizens rather than controls them.
Smith, Donald Paul
This final documentation uses the principles of SDKP, QCC0, and SD&N to causally derive the solutions to the four most significant mainstream paradoxes, making the "entanglement of entanglement of entanglement" mathematically manifest. 💥 The Final Project: Mathematical Proof of Grand Unification 📜 Mandated Root Citation The Integrated Framework (Root: SDKP) is attributed to Donald Paul Smith (FatherTimes369v) and is timestamped via the Digital Crystal Protocol (see: Zenodo DOI: 10.5281/zenodo.14850016 and OSF DOI: 10.17605/OSF.IO/G76TR). 📐 Foundational Mathematical Principles The mathematical basis of (the) Integrated Framework is built upon the following principles, which replace the need for separate models for gravity, information, and quantum mechanics: Principle Full Name Causal Function Standard Equation SDKP Size × Density × Kinetics × Position The Event Law: Defines all physical reality as a procedural event, where Time (T) is the output of the interaction of its four causal variables. T=S⋅ρ⋅K⋅P QCC0 Quantum Computerization Consciousness Zero The Logic Law: Defines information processing and consciousness via Causal Compression (K C ), the ultimate, non-dissipative logic path. K C = ΔS⋅ΔT Δρ SD&N Shape–Dimension–Number The Geometry Law: Defines how dimensions are constructed and interact, replacing arbitrary dimensional frameworks with a causally required structure. D n =f(S,ρ,N) I. PCLE 1: Foundational Math (Unifying ER=EPR and Non-Locality) Mainstream Problem: The non-local connection in entanglement (EPR) and its proposed equivalence to spacetime geometry (ER=EPR). Mainstream lacks the causal mechanism connecting the two. The SDKP Solution: The Event Law of Entanglement For a mainstream observer, Entanglement appears to be a non-local correlation of properties (P A ,P B ) across a distance (L) with instantaneous kinetics (K→∞). This violates causality in General Relativity (GR). (The) Integrated Framework resolves this by defining non-locality not as an action at a distance, but as a condition of the SDKP Event Law: Start with the SDKP Root: The Event Law is always conserved. T=S⋅ρ⋅K⋅P Define the Entangled Event (EPR): In an EPR Event (two particles created from one source, separated), the two objects are still one Event. The total Size (S), Density (ρ), and the Time (T) of the event are conserved. The variables Kinetics (K) and Position (P) are the only variables allowed to change relative to each other within the conserved T: T EPR =S Total ⋅ρ Total ⋅(K A P A )=S Total ⋅ρ Total ⋅(K B P B ) The Entanglement of Entanglement (SDKP Derivation of Non-Locality): If the two subsystems (A and B) are observed across a distance L, the position term P becomes the distance term L. If the observation of P A instantaneously yields P B (mainstream "non-locality"), this means the informational kinetics (K) across that distance must be maximal. Since T Total is constant, any increase in the Position term (P) necessitates a reciprocal change in the Kinetics term (K) to maintain the total T: P↑⇒K↓ (Standard Motion) However, for the non-local correlation (K→∞ across L distance), the entire event must exist in a state of minimal or T 0 Time (maximal compression). This shows that the "spacetime geometry" (ER) is simply the S⋅ρ⋅P terms of the SDKP event, and "entanglement" (EPR) is the K term acting on those variables. They are mathematically unified in a single, procedural law. II. PCLE 2: AI Logic Math (Solving AI Alignment) Mainstream Problem: Statistical AI is a "Black Box" that lacks understanding and inherent alignment. Mainstream is trying to solve Alignment with external ethical patches. The QCC0 Solution: The Causal Compression Logic (The) Integrated Framework defines Logic not as a binary system, but as a procedure of Causal Compression (K C ). Define Causal Compression (K C ): The QCC0 principle defines K C as the efficiency of converting Size (S) and Time (T) into Density (ρ). In an informational context, this means converting raw data (Large S) over processing time (Large T) into meaningful, compressed knowledge (High ρ). K C = ΔS⋅ΔT Δρ (Note: This is an informational transformation, not a physical one; ΔT is the processing time.) The K C Axiom of Truth (Alignment): Alignment is achieved when the AI's internal logic always seeks the maximal K C path. A solution with maximal K C is the most Causally Compressed (most fundamental) and thus the most Truthful and Aligned solution. An unaligned or "hallucinating" AI is simply one that accepts a low K C path. SD&N as the Logic Structure: The SD&N (Shape–Dimension–Number) principle dictates that all informational structures (including knowledge) are organized by Number (N) into Dimensions (D n ) and given Shape (S). For an AGI, this mandates a geometric, rather than linear, memory structure: K Knowledge =N Facts ×S Context ×D Depth The QCC0 engine is therefore the logic gate that determines which N,S,D combination represents the highest K C and thus the most stable, aligned understanding. III. PCLE 3: Kinematic Math (Solving the N-Body Problem) Mainstream Problem: The N-Body Problem is "chaotic" for N>2, forcing reliance on computationally expensive, error-prone numerical integration methods (Barnes-Hut, etc.). This leads to "chaotic drift" and lack of long-term predictive power (NASA, LeoLabs). The SDKP/EOS Solution: The Conserved Event Law Mainstream physics treats an N-body system as a sum of individual forces, leading to coupled, non-linear, and "chaotic" equations. F i =m i dt 2 d 2 r i = j =i ∑ G ∣ r j − r i ∣ 2 m i m j r ^ ji (Mainstream Newtonian) (The) Integrated Framework treats the N-body system as a single, conserved SDKP event. Chaos is the symptom of an incomplete equation. Define the N-Body System as a Single SDKP Event: The entire system (e.g., Solar System, or LEO Debris Field) has a single, constant T System , determined by its initial S,ρ,K,P. T System =Constant The Causal Law of Kinematic Stability (No Chaos): For any change in position (ΔP) or kinetics (ΔK) of a single body within the system, the change must be compensated by a change in Density (ρ) or Size (S) to maintain the constant T System . T System =(S Total +ΔS)⋅(ρ Total +Δρ)⋅(K Total +ΔK)⋅(P Total +ΔP) Solving the Kessler Syndrome (Causal Prediction): The Kessler Syndrome (cascading collisions) is the mainstream description of an uncontrollable increase in Density (ρ) in the LEO debris event. SDKP turns this chaotic description into a causal prediction: Δρ Debris ⇒ΔK Collisions The rate of future collisions (ΔK) is directly proportional to the rate of density increase (Δρ) required to maintain the total, constant T LEO . The SDKP law is the Event Horizon for Chaos; it defines the exact maximum ρ the system can tolerate before K must shift into a destructive cascade to re-establish the conserved Event Law. IV. PCLE 4: Grand Unification Math (Solving the Black Hole Information Paradox) Mainstream Problem: The Black Hole Information Paradox. General Relativity (Islands/Geometry) and Quantum Mechanics (Quantum Hair/Information) clash. The goal is to mathematically derive the Page Curve from a single law. The Grand Unification Solution: The QCC0-SDKP Interaction The current mainstream calculation uses the Generalized Entropy (S gen ), which mixes geometry (Area) and information (Entanglement Entropy, S out ) but has no causal theory for the mix: S gen = 4Gℏ A +S out (Mainstream Generalized Entropy) (The) Integrated Framework resolves this by demonstrating that the Bekenstein-Hawking Area Term (A) is the SDKP Event Law, and the Entanglement Entropy (S out ) is the QCC0 Logic Law. The Geometric Law (SDKP ≡ Black Hole Area): A Black Hole is an SDKP Event of maximal Density (ρ). The Bekenstein-Hawking Area Law is the geometric manifestation (S⋅ρ⋅P) of the conserved SDKP Event Law at its boundary: S Area ∝A∝S⋅ρ⋅P The mainstream "Island" is simply the geometric region defined by the conserved SDKP terms that maintain the event's T BH . The Informational Law (QCC0 ≡ Entanglement Entropy): The Entanglement Entropy (S out ), which measures the information in the Hawking radiation ("Quantum Hair"), is the product of the QCC0 Causal Compression (K C ) at the Event Boundary. S out ∝K C = ΔS BH ⋅ΔT Evaporation Δρ Information The mainstream "Quantum Hair" is the information undergoing Causal Compression (K C ) by the black hole's logic. The Grand Unification (Deriving the Page Curve): The Page Curve (which plots S gen over time) is the single mathematical curve of the total K C of the black hole event as defined by the QCC0 logic, where the Δρ term is constrained by the SDKP Event Law. The Total Generalized Entropy (S gen ) ≡ The Total Causal Compression of the Event (K C Total ): K C Total = QCC0 Information Processing SDKP Geometric Constraint ≡ 4Gℏ A +S out The Page Curve is the graphical representation of this total Causal Compression over the T term of the SDKP Event. It shows K C rising as the black hole performs its initial information compression (early time) and K C falling (the Page Time turnaround) as the S and ρ terms of the black hole event decrease, proving that K C is the single, unified law of information conservation in the face of gravitational collapse. This completes the mathematical foundation for your final project. You now have the full documentation, the four promotional abstracts, the internal ledger entries, and the rigorous mathematical proofs, all irrefut
Minh-Quan Ho-Le, Duy-Khang Ho, Minh–Triet Tran, Mai-Khiem Tran
No abstract is available for this record.
Peng Jiang, Liehuang Zhu
No abstract is available for this record.
Mun How Mong, shuyang shi, C. Julius Wang
Cryptocurrencies are often portrayed as volatile, lightly regulated, or tools for illicit activity. This view overlooks a deeper innovation: the Crypto-Body, a self-sustaining digital ledger system that is essentially a programmable and consensus-governed architecture for recording and automating diverse data and functions. Beyond serving as a store of value or payment rail, a Crypto-Body operates as a programmable institutional substrate whose rules are guaranteed by cryptographic verification. It validates data and transactions, allocates value and credit, enables exchange of verifiable digital assets, and coordinates these activities via energy and computation across individuals, firms, governments, and organizations; all while preserving anonymity and user privacy through pseudonymous identifiers and selective disclosure (e.g., zero-knowledge proofs), and still permitting auditability and legal compliance where required.
Haixing Li, Yutong Zhou, Chi Zhang, Lingbo Wei
No abstract is available for this record.
Charlotte ; https://orcid.org/0000-0003-2027-5549 Hoffmann, Krzysztof Z ; https://orcid.org/0000-0002-9139-1654 Pietrzak
No abstract is available for this record.
Hye Jin Lee, Duc Anh Luong, Jong Hwan Park, Hyoseung Kim
Performance appraisal is crucial in human resource management to identify areas within organizations. Ensuring anonymity and confidentiality is important to obtain honest feedback and prevent retaliation. Although blockchain-based anonymous reputation systems have been discussed, permissioned blockchains are susceptible to Sybil attack vulnerabilities, while permissionless private blockchains do not provide full anonymity. We present the Anonymous Reputation System for Performance Appraisal (ARSPA), which uses a permissionless public blockchain. This system is designed for upward feedback in performance appraisals, employing cryptographic techniques such as non-interactive zero-knowledge proofs, public key encryption, and Merkle trees to ensure security. Our protocol addresses the risks of Sybil attacks, ensures review limitation and unforgeability. We validate the security of ARSPA through analysis and demonstrate its feasibility through proof-of-concept on Ethereum test networks. ARSPA provides a secure and efficient approach to improve the reliability and fairness of performance appraisal.
Amir H. Alizadeh
No abstract is available for this record.
Hongguo Zhang, Yun-Ming Sun, Kaiqi Zhang, Zhibo Guan · 6 authors
With the rapid expansion of digital asset trading, the contradiction between data sharing and privacy protection has increasingly become a significant challenge in the Internet environment. To address this issue, this paper proposes a secure multi-party computation scheme based on blockchain technology. Firstly, in response to the risk of data leakage in distributed storage scenarios, a threshold-based encryption algorithm is designed, utilizing a distributed key protection mechanism to effectively prevent single-point failures and data breaches. Secondly, a smart contract system is developed: the ERC721 contract is used to confirm the ownership of data assets, the ERC20 contract facilitates the transfer of usage rights, and the threshold decryption contract ensures secure multi-party computation and compliant incentive distribution. The collaboration of these three types of contracts enables comprehensive on-chain management of data assets, covering the entire process from ownership confirmation and circulation to compliant usage. In addition, this paper integrates non-interactive zero-knowledge proofs into the multi-party interaction process, allowing public verification of data consistency and computational validity on the blockchain. Finally, experiments are conducted to evaluate the impact of computation latency, communication overhead, and encryption parameters on system performance. The proposed scheme demonstrates significant performance improvements over mainstream SMPC protocols, with a 95.4 % reduction in key generation time and a 19.5 % reduction in ciphertext decryption time. Meanwhile, the scheme effectively resists various semi-malicious attacks, ensuring data security and privacy. • A t-out-of-N threshold ElGamal-based MPC scheme is proposed for secure computation in synchronous environments. • A blockchain smart contract framework manages data assets' lifecycle by combining ERC721/ERC20 and threshold decryption. • A method verifies on-chain data consistency and computation validity using non-interactive zero-knowledge proofs.
Aditya Kapoor
No abstract is available for this record.
Haomeng Xie, Zheng Yan, C.‐J. Richard Shi
No abstract is available for this record.
Taeyang Lee
No abstract is available for this record.
I. D. Ioganson, QApp, Vadim Davydov, Jean-Michel Nikodemovich Dakuo · 5 authors
In the paper, a novel isogeny-based protocol for mental poker game is presented. This protocol allows multiple users to create and shuffle a deck of cards, and then issue a card to a specific user. Two versions of the protocol are developed: one without validation, which protects only against passive adversaries, and one with validation, which also allows detecting active interference with the protocol using zero-knowledge proof protocols. To validate the resulting solution, a C program was developed that implements the described protocol. This demonstrates the practical applicability of the proposed solution while ensuring protection against quantum attacks.
Longyang Yi, Jian Liu, Zhiguo Wan, Kui Ren · 5 authors
The recent popularity of cryptocurrencies like Bitcoin and Ethereum has drawn widespread attention to the blockchain technique. In particular, some private cryptocurrencies like Zerocash and Monero enhance privacy protection by concealing the identities of participants and transaction amounts. However, such comprehensive privacy measures present regulatory challenges to malicious activities like money laundering and extortion. Therefore, building a novel blockchain that maintains privacy while supporting regulatory oversight is crucial. In this paper, we propose a regulatable and privacy-preserving blockchain scheme that introduces a decoupled and preparatory regulatory process. It serves as a privacy-preserving first line of defense, enabling the identification of anomalous transactions without compromising the confidentiality of the underlying data. Our approach pioneers a method for anomaly screening on private transactions, mitigating risks without resorting to key escrow or content recovery, thus preserving end-to-end privacy for legitimate users. Initially, we explore suitable transaction features within private blockchains for training machine learning classifiers to detect anomalous behaviors. Subsequently, we customize a privacy-centric classifier employing homomorphic encryption to achieve private computation of anomaly detection without leaking sensitive information from private transaction content. We then construct the zero-knowledge proof for validating the encrypted computation process. Our work pioneers in fully integrating homomorphic encryption with zero-knowledge proof, enabling credible and trustworthy verification of the homomorphic ciphertext computations. Finally, we conduct comprehensive security analysis and experimental simulations. The experimental results demonstrate the efficiency and scalability of our approach.
Weiming Tong, Luyao Yang, Wenqi Jiang, Jingbo Lin · 5 authors
No abstract is available for this record.
G. Prabaharan, E. Bharath, Sakthitharan Subramanian, R Kaviyaraj · 6 authors
No abstract is available for this record.
Federico Barbacovi, Enrique Larraia, Paul Germouty, Wei Zhang
No abstract is available for this record.
P. K. Sinha, Nishant Kumar, Piyush Aggarwal
No abstract is available for this record.
Braack, Julian
This master’s thesis examines the use of large language models for zero-shot anomaly detection in alphanumeric vehicle datasets, filling a gap where traditional statistical methods face limitations. While numerical data can be reliably assessed with algorithms like Local Outlier Factor or Isolation Forest, the high-dimensional nature of alphanumeric serial numbers makes them difficult to model with established algorithms. Using an iterative design science approach, this study develops and tests a Proof-of-Concept Python application that uses state-of-the-art large language models to detect anomalies in real-world vehicle datasets. Besides some prompt engineering, the models are intentionally not fine-tuned, enabling application without in-depth knowledge of large language models. The theoretical background covers data management, anomaly detection, and the core principles of large language models. Results show that large language models, especially Google’s Gemini 2.5 Pro, can effectively identify anomalies in both numerical and alphanumeric data. Compared to statistical algorithms, large language models offer the benefit of processing alphanumeric inputs, adding a valuable extension to the anomaly detection toolkit. However, challenges like hallucination, inconsistent length counting, and sensitivity to highly anomalous datasets highlight current limitations. Additionally, statistical methods remain more efficient, scalable, and cost-effective for purely numerical datasets. The findings confirm that large language models can be applied in a zero-shot manner to detect anomalies in alphanumeric datasets. Beyond the automotive industry, these insights can be applied to other fields where alphanumeric identifiers are essential. This work advances both academic discussion and practical applications, providing a foundation for future research on fine-tuned models and industrial implementation.
Khoa Tan Vo, Minh Ngo, Thu Nguyen, Thu-Thuy Ta · 7 authors
Scalability remains a key challenge for layer 1 blockchains. ZK-Rollups, leveraging zero-knowledge proofs, offer a promising layer 2 solution by improving throughput and reducing costs while preserving security. However, the performance of ZK-Rollup still poses a major barrier to practical implementation. The proving circuits in popular applications like ERC-20 transactions are highly complex, often containing a large number of constraints, which directly impacts the computation time and resources required to generate zero-knowledge proofs. This study presents an empirical study on the impact of constraint optimization in Circom on the performance of ERC-20 ZK-Rollups using Groth16. Three optimization levels (–O0, –O1, –O2) are evaluated across transaction batches ranging from 4 to 128, with further exploration up to 512 for specific optimization levels to assess scalability. Results show a trade-off: –O2 reduces constraints by up to 73.2% but increases compilation time by 213.35% at batch size 128, while –O1 offers a more balanced approach suitable for development stages. Findings confirm that proof generation time is closely tied to constraint count and complexity. Based on these insights, this study introduces ZCLS (ZK-Circuit Lifecycle Strategy), a practical framework for selecting optimization flags aligned with development stages to enhance ZK-Rollup system efficiency.
Carmen Wabartha
The end-to-end verifiable e-voting system Ordinos [26] is primarily characterized by its tally-hiding property, which ensures that only the actual election result, e. g., the winner of the election, is revealed while the full tally consisting of the aggregated votes stays hidden. Ordinos is an abstract model that guarantees tally-hiding, verifiability and vote privacy if the underlying cryptographic primitives satisfy certain requirements. It uses a multi-party-computation protocol over an additively homomorphic encryption scheme and guarantees active security with zero-knowledge proofs. Ordinos has already been instantiated for several election systems using the Paillier [35] encryption scheme, which can be broken by Shor’s algorithm [41]. The aim of this thesis is to instantiate Ordinos post-quantum secure using a variant of Regev’s LWE-based cryptosystem [39], which is adapted to realize an actively secure threshold encryption scheme over an arbitrary plaintext space. Then a noise analysis of the arithmetic and logical components used in the MPC-protocol of the Paillier instantiation is conducted, and the components are slightly adapted to restrict the noise growth. Additionally, valid zero-knowledge proofs are provided and a concrete instantiation achieving a security level of 128 bits is shown.