<--- Back to Details
First PageDocument Content
Electronic engineering / Digital electronics / Electronics / Electronic design automation / Electronic design / Logic in computer science / Cryptographic protocols / Garbled circuit / Boolean circuit / Sequential logic / Logic synthesis / Standard cell
Date: 2015-05-11 16:43:20
Electronic engineering
Digital electronics
Electronics
Electronic design automation
Electronic design
Logic in computer science
Cryptographic protocols
Garbled circuit
Boolean circuit
Sequential logic
Logic synthesis
Standard cell

2015 IEEE Symposium on Security and Privacy TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits Ebrahim M. Songhori∗ , Siam U. Hussain∗ , Ahmad-Reza Sadeghi† , Thomas Schneider† , Farinaz Kous

Add to Reading List

Source URL: www.ieee-security.org

Download Document from Source Website

File Size: 485,75 KB

Share Document on Facebook

Similar Documents

Sparse Boolean Equations and Circuit Lattices Igor Semaev University of Bergen Norway  SHARCS, 9 September 2009

Sparse Boolean Equations and Circuit Lattices Igor Semaev University of Bergen Norway SHARCS, 9 September 2009

DocID: 1xUha - View Document

ALGEBRAIC CHARACTERIZATIONS OF QUANTUM COMPUTATIONAL LOGICS MARIA LUISA DALLA CHIARA AND ROBERTO GIUNTINI Classical circuit theory is basically irreversible in the sense that Boolean functions (gates) are generally descr

ALGEBRAIC CHARACTERIZATIONS OF QUANTUM COMPUTATIONAL LOGICS MARIA LUISA DALLA CHIARA AND ROBERTO GIUNTINI Classical circuit theory is basically irreversible in the sense that Boolean functions (gates) are generally descr

DocID: 1tIxP - View Document

2015 IEEE Symposium on Security and Privacy  TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits Ebrahim M. Songhori∗ , Siam U. Hussain∗ , Ahmad-Reza Sadeghi† , Thomas Schneider† , Farinaz Kous

2015 IEEE Symposium on Security and Privacy TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits Ebrahim M. Songhori∗ , Siam U. Hussain∗ , Ahmad-Reza Sadeghi† , Thomas Schneider† , Farinaz Kous

DocID: 1rrYP - View Document

CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1

CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1

DocID: 1r4rE - View Document

cs281: Computer Organization  Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit. We saw in La

cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit. We saw in La

DocID: 1pkGI - View Document