Search
Search Results
-
Arithmetic Sketching
This paper introduces arithmetic sketching, an abstraction of a primitive that several previous works use to achieve lightweight, low-communication...
-
Efficient Arithmetic in Garbled Circuits
Garbled Circuit (GC) techniques usually work with Boolean circuits. Despite intense interest, efficient arithmetic generalizations of GC were only...
-
Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC
Secure multi-party computation (MPC) enables multiple distrusting parties to compute a function while kee** their respective inputs private. In a...
-
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning
This survey presents a necessarily incomplete (and biased) overview of results at the intersection of arithmetic circuit complexity, structured...
-
New Ways to Garble Arithmetic Circuits
The beautiful work of Applebaum, Ishai, and Kushilevitz [FOCS’11] initiated the study of arithmetic variants of Yao’s garbled circuits. An arithmetic...
-
A Survey of Approximate Computing: From Arithmetic Units Design to High-Level Applications
Realizing a high-performance and energy-efficient circuit system is one of the critical tasks for circuit designers. Conventional researchers always...
-
Modeling and simulation of FIR filter using distributed arithmetic algorithm on FPGA
In many industries and telecommunication system there is a need for digital signal processing for fast transfer of data between two points or devices...
-
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
The elliptic curve discrete logarithm problem (ECDLP) is a popular choice for cryptosystems due to its high level of security. However, with the...
-
Rinocchio: SNARKs for Ring Arithmetic
Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient verification of NP computations and admit short proofs....
-
Fine-grained flexible access control: ciphertext policy attribute based encryption for arithmetic circuits
Applying access structure to encrypted sensitive data is one of the challenges in communication networks and cloud computing. Various methods have...
-
Toward Malicious Constant-Rate 2PC via Arithmetic Garbling
A recent work by Ball, Li, Lin, and Liu [Eurocrypt’23] presented a new instantiation of the arithmetic garbling paradigm introduced by Applebaum,...
-
-
Advancements in arithmetic optimization algorithm: theoretical foundations, variants, and applications
Arithmetic optimization algorithm (AOA) is a population-based metaheuristic algorithm that mimics the properties of primitive arithmetic operators....
-
Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling
In this work, we show how to garble arithmetic circuits with full active security in the general multiparty setting, secure in the full-threshold...
-
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead
We study the complexity of two-party secure arithmetic computation where the goal is to evaluate an arithmetic circuit over a finite field...
-
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph H to n -vertex graphs. These...
-
A nano-scale arithmetic and logic unit using a reversible logic and quantum-dots
The arithmetic and logic unit (ALU) is a key element of complex circuits and an intrinsic part of the most widely recognized complex circuits in...
-
Introducing scalable 1-bit full adders for designing quantum-dot cellular automata arithmetic circuits
Designing logic circuits using complementary metal-oxide-semiconductor (CMOS) technology at the nano scale has been faced with various challenges...
-
How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations
The study of garbling arithmetic circuits is initiated by Applebaum, Ishai, and Kushilevitz [FOCS’11], which can be naturally extended to mixed...
-
Efficient design of a quantum absolute-value circuit using Clifford+T gates
Current quantum computers have a limited number of resources and are heavily affected by internal and external noise. Therefore, small,...
