Filters








63 Hits in 6.7 sec

Two Halves Make a Whole [chapter]

Samee Zahur, Mike Rosulek, David Evans
2015 Lecture Notes in Computer Science  
In this work we show how to simultaneously garble AND gates using two ciphertexts and XOR gates using zero ciphertexts, resulting in smaller garbled circuits than any prior scheme.  ...  Each half-gate can be garbled with a single ciphertext, so our construction uses two ciphertexts for each AND gate while being compatible with free-XOR gates.  ...  Acknowledgements We thank Jonathan Dorn for providing the energy usage metering apparatus for our experiments and helping us use it. Mike Rosulek was supported by NSF Award 1149647.  ... 
doi:10.1007/978-3-662-46803-6_8 fatcat:6zvb5gcy5vhw7ozz2vicjrhnpu

Fast and Secure Three-party Computation

Payman Mohassel, Mike Rosulek, Ye Zhang
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
Our protocol is based on garbled circuits and provides security against a single, malicious corrupt party. Unlike information-theoretic 3PC protocols, ours uses a constant number of rounds.  ...  Our protocol only uses inexpensive symmetric-key cryptography: hash functions, block ciphers, pseudorandom generators (in particular, no oblivious transfers) and has performance that is comparable to that  ...  P 3 can put together the two unhashed halves to construct the whole garbled circuits, and uses the hashed halves to check equality of the two garbled circuits.  ... 
doi:10.1145/2810103.2813705 dblp:conf/ccs/MohasselRZ15 fatcat:jrjvkxkujfh5llgdwjlneykdmu

Efficiency Optimizations on Yao's Garbled Circuits and Their Practical Applications [article]

Osman Biçer
2017 arXiv   pre-print
The advance of cloud computing and big data technologies brings out major changes in the ways that people make use of information systems.  ...  We compare those generic implementations in terms of their use of garbled circuit optimizations. We also cover the specific real-world applications for further illustration.  ...  Mainly, privacy-preserving data mining is applied to two classic settings [10]: 1. Instead of a single party having the whole data set, two or more parties hold different parts of it.  ... 
arXiv:1703.03473v1 fatcat:gs2s3d4s3vbnff2ckjr24sbdwm

Improvements for Gate-Hiding Garbled Circuits [chapter]

Mike Rosulek
2017 Lecture Notes in Computer Science  
These state-of-the-art constructions also require a non-minimal hardness assumption. We introduce two new gate-hiding constructions of garbled circuits.  ...  In this paper we consider optimizing garbled circuits for the gate-hiding case.  ...  Two halves make a whole -reducing data transfer in garbled circuits using half gates. In Elisabeth Oswald and Marc Fischlin, editors, EUROCRYPT 2015, Part II, volume 9057 of LNCS, pages 220-250.  ... 
doi:10.1007/978-3-319-71667-1_17 fatcat:qeq4aitg3jaqbdz7vugu77g2tq

Linicrypt: A Model for Practical Cryptography [chapter]

Brent Carmer, Mike Rosulek
2016 Lecture Notes in Computer Science  
We demonstrate this approach by synthesizing Linicrypt constructions of garbled circuits. * Full version of a paper appearing in CRYPTO 2016.  ...  In other words, it is possible to use a SAT/SMT solver to automatically generate Linicrypt programs satisfying a given security constraint.  ...  Acknowledgement We thank Viet Tung Hoang for pointing out to us some subtleties that arise when wires have correlated labels.  ... 
doi:10.1007/978-3-662-53015-3_15 fatcat:d4e5qcu7evc4dbm2vnetfj2tea

TinyKeys: A New Approach to Efficient Multi-Party Computation [chapter]

Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2018 Lecture Notes in Computer Science  
We also obtain more efficient constantround MPC, using BMR-style garbled circuits with short keys, and present an implementation of the online phase of this protocol.  ...  We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting.  ...  reduces size of the garbled circuit by a factor κ/ BMR , for BMR -bit keys, but still requires n keys for every row in the garbled gates.  ... 
doi:10.1007/978-3-319-96878-0_1 fatcat:k7xjoou2ifcjvfol443kkblsrm

MOTION - A Framework for Mixed-Protocol Multi-Party Computation [article]

Lennart Braun, Daniel Demmler, Thomas Schneider, Oleksandr Tkachenko
2020 IACR Cryptology ePrint Archive  
MOTION is built in a user-friendly, modular, and extensible way, intended to be used as tool in MPC research and to increase adoption of MPC protocols in practice.  ...  Compared to secure evaluation of AES-128 with 𝑁 =3 parties in a high-latency network with OT-based BMR, we achieve a 16× better throughput of 16 AES evaluations per second using BMR.  ...  two-party garbled circuits.  ... 
dblp:journals/iacr/BraunDST20 fatcat:go4yuczku5fo7hfwwkrc6qswcu

Gazelle: A Low Latency Framework for Secure Neural Network Inference [article]

Chiraag Juvekar, Vinod Vaikuntanathan, Anantha Chandrakasan
2018 arXiv   pre-print
(such as garbled circuits).  ...  Our work tackles this problem in the context where a client wishes to classify private images using a convolutional neural network (CNN) trained by a server.  ...  ACKNOWLEDGMENTS: We thank Kurt Rohloff, Yuriy Polyakov and the PALISADE team for providing us with access to the PALISADE library.  ... 
arXiv:1801.05507v1 fatcat:sbo4nsu3ufbahfmfmeegqter2a

An introduction to local area networks

D.D. Clark, K.T. Pogran, D.P. Reed
1978 Proceedings of the IEEE  
LOcrlare81letwmksuse &pneral-purpae data M e r netwak. There .re two basic issues m loal area netwak desi@.  ...  Secand, A t protocols should be w d f a the apemt~an of the wtwak?  ...  In addition to its fitering function, the controller of a half-bridge regulates the flow of data over the communication link between the two halves of the bridge.  ... 
doi:10.1109/proc.1978.11152 fatcat:momgta2yq5chdd2svlqxhbma4i

Low-latency Meets Low-area: An Improved Bit-Sliding Technique for AES, SKINNY and GIFT [article]

Fatih Balli, Andrea Caforio, Subhadeep Banik
2020 IACR Cryptology ePrint Archive  
Although these results are promising, block ciphers themselves are not end-user primitives, as they need to be used in conjunction with a mode of operation.  ...  In the wake of this effort, we provide the smallest block-cipher-based authenticated encryption circuits known in the literature so far.  ...  Acknowledgments: We wish to thank Begül Bilgin for helping us improve this draft.  ... 
dblp:journals/iacr/BalliCB20 fatcat:6xxlz6x2tbgordprwoilbes2wq

The Area-Latency Symbiosis: Towards Improved Serial Encryption Circuits

Fatih Balli, Andrea Caforio, Subhadeep Banik
2020 Transactions on Cryptographic Hardware and Embedded Systems  
Although these results are promising, block ciphers themselves are not end-user primitives, as they need to be used in conjunction with a mode of operation.  ...  In the wake of this effort, we provide the smallest block-cipher-based authenticated encryption circuits known in the literature so far.  ...  Acknowledgements We wish to thank Begül Bilgin for helping us improve this draft.  ... 
doi:10.46586/tches.v2021.i1.239-278 fatcat:dnu5lj3v5nh2tb7xwrfuh7o2dm

Practical MPC+FHE with Applications in Secure Multi-PartyNeural Network Evaluation [article]

Ruiyu Zhu, Changchang Ding, Yan Huang
2020 IACR Cryptology ePrint Archive  
The theoretical idea of using FHE to realize MPC has been there for over a decade.  ...  Existing threshold (and multi-key) FHE schemes were constructed by modifying and analyzing a traditional single-key FHE in a case-by-case manner, thus technically highly-demanding.  ...  We appreciate Miran Kim and Xiaoqian Jiang from UT Health for answering our questions in the CKKS schemes [37, 38] .  ... 
dblp:journals/iacr/ZhuDH20 fatcat:htkdar6jfvgotjozmnc2miwxiy

Fast and Secure Three-party Computation

Payman Mohassel, Mike Rosulek, Ye Zhang
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15   unpublished
Our protocol is based on garbled circuits and provides security against a single, malicious corrupt party. Unlike information-theoretic 3PC protocols, ours uses a constant number of rounds.  ...  Our protocol only uses inexpensive symmetric-key cryptography: hash functions, block ciphers, pseudorandom generators (in particular, no oblivious transfers) and has performance that is comparable to that  ...  P3 can put together the two unhashed halves to construct the whole garbled circuits, and uses the hashed halves to check equality of the two garbled circuits.  ... 
fatcat:ygpct5um6nazbedm47j76dzc4a

Computer Networking [article]

Kurose Ross
2017 Zenodo  
Indeed, it's our aim in this book to provide you with a modern introduction to the dynamic field of computer networking, giving you the principles and practical insights you'll need to understand not only  ...  Given that the Internet is so large and has so many diverse components and uses, is there any hope of understanding how it works?  ...  Acknowledgments Since we began writing this book in 1996, many people have given us invaluable help and have been  ... 
doi:10.5281/zenodo.5599466 fatcat:roncomlhjrf7dafpacammhf6xq

Applied cryptography: Protocols, algorithms, and source code in C

1994 Computer Law and Security Review  
FF (a, b, c, d, M 12 , 7, 0x6b901122) FF (d, a, b, c, M 13 Those constants, t i , were chosen as follows: In step i, t i is the integer part of 2 32 *abs(sin(i)), where i is in radians.  ...  After all of this, a, b, c, and d are added to A, B, C, D, respectively, and the algorithm continues with the next block of data. The final output is the concatenation of A, B, C, and D.  ...  This technique is made more secure by splitting the key into two halves, storing one half in the terminal and the other half in the ROM key.  ... 
doi:10.1016/0267-3649(94)90017-5 fatcat:y5tchirflfdwno7dm4dv6ljx2a
« Previous Showing results 1 — 15 out of 63 results