• Cite Icon1
  • https://doi.org/10.1007/978-3-642-30042-4_3Copy DOI Icon

Circuit Optimizations and Constructions

  • Jan 1, 2012
  • Thomas Schneider
Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

The complexity of many cryptographic protocols, including today’s most efficient Secure Function Evaluation (SFE) protocols, depends linearly on the size of the boolean circuit representation of the function to be evaluated. In this chapter we show how to optimize boolean circuits for cryptographic protocols and give efficient circuit constructions. We first motivate protocols that allow “free” evaluation of XOR gates: (SFE), Homomorphic Encryption (HE), and zero-knowledge (Introduction). Afterwards, we give optimization algorithms that reduce the size of boolean circuits in particular when XOR gates can be evaluated “for free” in circuit optimizations. In circuit constructions we show how our optimizations allow one to construct more efficient circuits for standard functionalities such as integer comparison. We also give efficient circuit constructions for computing minima (or maxima) and for fast multiplication. As applications we consider efficient protocols for secure comparison and first-price auctions in applications: secure comparison auctions.

Similar Papers
  • Book Chapter
  • Citations5

Bandwidth-Optimized Secure Two-Party Computation of Minima

  • Jan 01, 2015
  • Jan Henrik Ziegeldorf +4
  • Conference Article

FlexHE: A flexible Kernel Generation Framework for Homomorphic Encryption-Based Private Inference

  • Oct 27, 2024
  • Jiangrui Yu +7
  • Book Chapter
  • Citations71

Classical Cryptographic Protocols in a Quantum World

  • Jan 01, 2011
  • Sean Hallgren +2
  • Research Article
  • Citations3

Current Status and Future Development of Quantum Cryptographic Protocols

  • Jan 01, 2022
  • Chinese Journal of Engineering Science
  • Xue Zhang +3
  • Research Article
  • Citations10

On compiling Boolean circuits optimized for secure multi-party computation

  • Sep 14, 2017
  • Formal Methods in System Design
  • Niklas Büscher +4
  • Conference Article
  • Citations392

TASTY

  • Oct 04, 2010
  • Wilko Henecka +4
  • Conference Article
  • Citations17

Power and Performance Efficient Partial Circuits in Packet-Switched Networks-on-Chip

  • Feb 01, 2013
  • N Teimouri +2
  • Book Chapter
  • Citations145

Token-Based Cloud Computing

  • Jan 01, 2010
  • Ahmad-Reza Sadeghi +2
  • Conference Article
  • Citations28

Fast zeta transforms for lattices with few irreducibles

  • Jan 17, 2012
  • Andreas Björklund +5
  • Book Chapter
  • Citations1

An Improved Secure Two-Party Computation Protocol

  • Jan 01, 2005
  • Yu Yu +2
  • Book Chapter
  • Citations107

GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits

  • Jan 01, 2013
  • Thomas Schneider +1
  • Research Article
  • Citations76

Generic quantum Fourier transforms

  • Oct 01, 2006
  • ACM Transactions on Algorithms
  • Cristopher Moore +2
  • Conference Article

Challenges in compiler construction for secure two-party computation

  • Nov 04, 2013
  • Andreas Holzer +4
  • Conference Article
  • Citations92

Circuits resilient to additive attacks with applications to secure computation

  • May 31, 2014
  • Daniel Genkin +4
  • PDF
  • Research Article
  • Citations5

Permutable Cut-and-Choose Oblivious Transfer and Its Application

  • Jan 01, 2020
  • IEEE Access
  • Xiaochao Wei +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.