Get started
Keyword

arithmetic circuits

Description: Arithmetic circuits are computational models built from addition and multiplication operations, studied in theoretical computer science and cryptographic proof systems.
Wikidata ID: wiki/Q4791120
OpenAlex ID: keywords/arithmetic-circuits
Digital integrated circuits : a design perspective
1996 · Jan M. Rabaey, Anantha P. Chandrakasan, et al. · CERN Document Server (European Organization for Nuclear Research) · 2,152
Computational Complexity
2009 · Sanjeev Arora, Boaz Barak · Cambridge University Press eBooks · 1,687
(Leveled) Fully Homomorphic Encryption without Bootstrapping
2014 · Zvika Brakerski, Craig Gentry, et al. · ACM Transactions on Computation Theory · 1,435
Bulletproofs: Short Proofs for Confidential Transactions and More
2018 · Benedikt Bunz, Jonathan Bootle, et al. · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · 1,149
PDF
Micropipelines
1989 · I. E. Sutherland · Communications of the ACM · 1,037
PDF
Algebraic Complexity Theory
1997 · Peter Bürgisser, Michael Clausen, et al. · Grundlehren der mathematischen Wissenschaften · 1,027
High-Speed Arithmetic in Binary Computers
1961 · O. Macsorley · Proceedings of the IRE · 626
New Metrics for the Reliability of Approximate and Probabilistic Adders
2012 · Jinghang Liang, Jie Han, et al. · IEEE Transactions on Computers · 608
Protecting Mobile Agents Against Malicious Hosts
1998 · Tomas Sander, Christian F. Tschudin · Lecture notes in computer science · 598
Digital arithmetic
2003 · Miloš D. Ercegovac, Toms Lang · 586
MP-SPDZ: A Versatile Framework for Multi-Party Computation
2020 · Marcel Keller · ACM SIGSAC Conference on Computer and Communications Security (CCS) · 513
Fully Homomorphic Encryption with Polylog Overhead
2012 · Craig Gentry, Shai Halevi, et al. · Lecture notes in computer science · 505
A differential approach to inference in Bayesian networks
2003 · Adnan Darwiche · Journal of the ACM · 471
PDF
ABY 3
2018 · Payman Mohassel, Peter Rindal · ACM SIGSAC Conference on Computer and Communications Security (CCS) · 432
Lower bounds for resolution and cutting plane proofs and monotone computations
1997 · Pavel Pudlák · Journal of Symbolic Logic · 418
MASCOT
2016 · Marcel Keller, Emmanuela Orsini, et al. · ACM SIGSAC Conference on Computer and Communications Security (CCS) · 412
PDF
Low-Power and Area-Efficient Carry Select Adder
2011 · B. Ramkumar, Harish M Kittur · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 388
Principles in the Evolutionary Design of Digital Circuits—Part II
2000 · Julian F. Miller, Dominic Job, et al. · Genetic Programming and Evolvable Machines · 381
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
2004 · Valentine Kabanets, Russell Impagliazzo · Computational Complexity · 378
Arithmetic Circuits: A Survey of Recent Results and Open Questions
2010 · Amir Shpilka, Amir Yehudayoff · Foundations and Trends® in Theoretical Computer Science · 366
VTR 7.0
2014 · Jason Luu, Jeffrey Goeders, et al. · ACM Transactions on Reconfigurable Technology and Systems · 362
Semi-homomorphic Encryption and Multiparty Computation
2011 · Rikke Bendlin, Ivan Damgård, et al. · Lecture notes in computer science · 359
On computing the determinant in small parallel time using a small number of processors
1984 · Stuart J. Berkowitz · Information Processing Letters · 347
Fully Homomorphic Encryption without Bootstrapping.
2011 · Zvika Brakerski, Craig Gentry, et al. · 331
Faster Fully Homomorphic Encryption
2010 · Damien Stehlé, Ron Steinfeld · Lecture notes in computer science · 330
Works count: 4,455
Citation count: 49,880
Year
Topic
Type