Search
Search Results
-
Efficient secure multi-party computation for proof of custody in Ethereum sharding
Ethereum, one of the most prominent and widely deployed blockchain systems, is undergoing a significant upgrade that adopts sharding for capacity...
-
Fast, Verified Computation for HOL ITPs
We add an efficient function for computation to the kernels of higher-order logic interactive theorem provers. First, we develop and prove sound our...
-
Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs
In the current landscape of cloud-based data storage and analysis, concerns about data privacy and integrity have become more and more prevalent....
-
An efficient quantum non-interactive zero knowledge proof for confidential transaction and quantum range proof
This paper investigated the Bitcoin blockchain and other crypto currencies confidential transaction techniques for cryptographic commitment in a...
-
A Quantum-Inspired Mechanical Method for Proving of Ramsey’s Theorem by Symbolic Computation over the Finite Field GF(2)
This paper presents a quantum-inspired method for proving Ramsey’s theorem using symbolic computation on conventional computers, an improvement of...
-
ECAUT: ECC-infused efficient authentication for internet of things systems based on zero-knowledge proof
The Internet of Things (IoT) has seen significant growth, enabling connectivity and intelligence in various domains which use RFID communication...
-
Fast Integral Bases Computation
We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a...
-
Secure Proof Verification Blockchain Patterns
In blockchain networks, transaction data is accessible to all participants by design and hence verifiable. This verifiability feature of data stored...
-
A proof system of the CaIT calculus
The Internet of Things (IoT) can realize the interconnection of people, machines, and things anytime, anywhere. Most of the existing research mainly...
-
Imperative Process Algebra and Models of Parallel Computation
Studies of issues related to computability and computational complexity involve the use of a model of computation. Central in such a model are...
-
Fast computation of General SimRank on heterogeneous information network
Similarity computation is a fundamental aspect of information network analysis, underpinning many research tasks including information retrieval,...
-
Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq
We address the challenges of scaling verification efforts to match the increasing complexity and size of systems. We propose a research agenda aimed...
-
Towards a Logical Foundation of Randomized Computation: Doctoral Thesis Abstract
Interactions between logic and theoretical computer science are multiple and profound. In the last decades, they have been deeply investigated, but,...
-
SEVCOD: secure and efficient verifiable computation on outsourced data
Cloud computing has gained significant popularity, as a promising service platform in recent years. It facilitates the users to offload their...
-
MuxProofs: Succinct Arguments for Machine Computation from Vector Lookups
Proofs for machine computation prove the correct execution of arbitrary programs that operate over fixed instruction sets (e.g., RISC-V, EVM, Wasm)....
-
Proof of Necessary Work: Succinct State Verification with Fairness Guarantees
Blockchain-based payment systems utilize an append-only log of transactions whose correctness can be verified by any observer. Classically,...
-
Internet Transparency Through Multi-party Computation
The inability to check how our Internet traffic is being handled and routed poses all kinds of security and privacy risks. Yet, for the typical...
-
EPVM: efficient and publicly verifiable computation for matrix multiplication with privacy preservation
With the rapid development of cloud computing, clients and users with limited computing resources can outsource their computation-intensive tasks to...
-
Secure multi-party computation with legally-enforceable fairness
Fairness is a security notion of secure computation and cannot always be achieved if an adversary corrupts a majority of parties in standard...
-
Square root computation in finite fields
In this paper, we present a review of three widely-used practical square root algorithms. We then describe a unifying framework where each of these...
