Search
Search Results
-
Efficient Arithmetic in Garbled Circuits
Garbled Circuit (GC) techniques usually work with Boolean circuits. Despite intense interest, efficient arithmetic generalizations of GC were only...
-
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...
-
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...
-
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...
-
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...
-
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...
-
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
We study the complexity of representing polynomials by arithmetic circuits in both the commutative and the non-commutative settings. Our approach...
-
Rinocchio: SNARKs for Ring Arithmetic
Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient verification of NP computations and admit short proofs....
-
Probability gate model based methods for approximate arithmetic circuits reliability estimation
With the rapid development of approximate computing technology, the reliability evaluation of approximate circuits has attracted significant...
-
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...
-
Arithmetic Sketching
This paper introduces arithmetic sketching, an abstraction of a primitive that several previous works use to achieve lightweight, low-communication...
-
Parallel algorithms for power circuits and the word problem of the Baumslag group
Power circuits have been introduced in 2012 by Myasnikov, Ushakov and Won as a data structure for non-elementarily compressed integers supporting the...
-
-
Lowering the cost of quantum comparator circuits
Quantum comparators hold substantial significance in the scientific community as fundamental components in a wide array of algorithms. In this...
-
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...
-
Efficient binary to quaternary and vice versa converters: embedding in quaternary arithmetic circuits
Reversible logic is a nowadays promising choice for circuit design technologies since it is having diversified applications in the fields of digital...
-
A Survey of Reliability Issues Related to Approximate Circuits
As one of the most promising paradigms of integrated circuit design, the approximate circuit has aroused widespread concern in the scientific...
-
Succinct Attribute-Based Signatures for Bounded-Size Circuits by Combining Algebraic and Arithmetic Proofs
Attribute-based signatures allow fine-grained attribute-based authentication and at the same time keep a signer’s privacy as much as possible. While...
-
Quantum circuits for computing Hamming distance requiring fewer T gates
The so-called Hamming distance measures the difference between two binary strings A and B. In simplified form, it measures the number of changes in A...
-
Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra
Verifying arithmetic circuits and most prominently multiplier circuits is an important problem which in practice is still considered to be...
