Filters








738 Hits in 3.0 sec

Fast Garbling of Circuits Under Standard Assumptions

Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
The justification behind making these strong assumptions has been that otherwise it is not possible to achieve fast garbling and thus fast secure computation.  ...  We provide new methods for garbling that are secure solely under the assumption that the primitive used (e.g., AES) is a pseudorandom function.  ...  Garbling under weaker yet non-standard assumption.  ... 
doi:10.1145/2810103.2813619 dblp:conf/ccs/GueronLNP15 fatcat:gtxg52zo3fa3xpnflbug5aeubi

Fast Garbling of Circuits Under Standard Assumptions

Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
2017 Journal of Cryptology  
The justification behind making these strong assumptions has been that otherwise it is not possible to achieve fast garbling and thus fast secure computation.  ...  We provide new methods for garbling that are secure solely under the assumption that the primitive used (e.g., AES) is a pseudorandom function.  ...  Garbling under weaker yet non-standard assumption.  ... 
doi:10.1007/s00145-017-9271-y fatcat:czsolipndnh2zevgpppso4safa

Hashing Garbled Circuits for Free [chapter]

Xiong Fan, Chaya Ganesh, Vladimir Kolesnikov
2017 Lecture Notes in Computer Science  
We introduce Free Hash, a new approach to generating Garbled Circuit (GC) hash at no extra cost during GC generation.  ...  This is in contrast with state-of-the-art approaches, which hash GCs at computational cost of up to 6× of GC generation.  ...  We thank the anonymous reviewers of Eurocrypt 2017 for valuable comments. We also thank Mike Rosulek for a discussion on the applicability of the Free Hash.  ... 
doi:10.1007/978-3-319-56617-7_16 fatcat:urnwbwmxyvhm7p3cahz7mfo4nu

FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR [chapter]

Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek
2014 Lecture Notes in Computer Science  
Most implementations of Yao's garbled circuit approach for 2-party secure computation use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008).  ...  For many circuits of cryptographic interest, this can yield a significantly (over 30%) smaller garbled circuit than any other known techniques (including free-XOR) or their combinations. * An extended  ...  Addressing this question, Applebaum [App13] showed that free-XOR can be realized in the standard model under the learning parity with noise (LPN) assumption.  ... 
doi:10.1007/978-3-662-44381-1_25 fatcat:yvgzfngvpvfzjesydbmvw7wgmu

Efficient Secure Computation with Garbled Circuits [chapter]

Yan Huang, Chih-hao Shen, David Evans, Jonathan Katz, Abhi Shelat
2011 Lecture Notes in Computer Science  
Although the standard garbled circuit protocol assumes a very week, honest-but-curious adversary, techniques are available for converting such protocols to resist stronger adversaries, including fully  ...  In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to scale to realistic  ...  The contents of this paper do not necessarily reflect the position or the policy of the US Government, and no official endorsement should be inferred.  ... 
doi:10.1007/978-3-642-25560-1_2 fatcat:nimee4aiqrhqtgdtqgqj2scg64

Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings [chapter]

Yehuda Lindell, Ben Riva
2014 Lecture Notes in Computer Science  
One of the fundamental techniques for obtaining secure computation is that of Yao's garbled circuits.  ...  the garbled circuit is constructed correctly.  ...  Instead of using the same output labels in all garbled circuits, P 1 uses random ones (as in the standard Yao's circuit).  ... 
doi:10.1007/978-3-662-44381-1_27 fatcat:j2ae5tqx6zb4dkakmrko6u6nau

Two-Output Secure Computation with Malicious Adversaries [chapter]

Abhi shelat, Chih-hao Shen
2011 Lecture Notes in Computer Science  
Since the circuits are garbled, P 1 could cheat by sending different inputs for the e copies of the garbled circuit.  ...  We present a method to compile Yao's two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability.  ...  It is well known that claw-free collections exist under either the Discrete Logarithm assumption or Integer Factorization assumption [7] .  ... 
doi:10.1007/978-3-642-20465-4_22 fatcat:ffxashwsprgjva6m3nzu5ernz4

Advances and impact of secure function evaluation

Vladimir Kolesnikov
2009 Bell Labs technical journal  
While most Internet traffic is of little or no interest to attackers, a portion of it serves transactions of value and requires strong security.  ...  The study of secure function evaluation  ...  We now briefly describe the complexity of GC. In practice, encryptions may be implemented with the (very fast) Advanced Encryption Standard (AES) e function.  ... 
doi:10.1002/bltj.20396 fatcat:b7lc7uklnrdkrisusa3z573jae

Amortizing Garbled Circuits [chapter]

Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff
2014 Lecture Notes in Computer Science  
We design efficient garbled-circuit-based two-party protocols secure against malicious adversaries.  ...  Recent works by Lindell (Crypto 2013) and Huang-Katz-Evans (Crypto 2013) have obtained optimal complexity for cut-and-choose performed over garbled circuits in the single execution setting.  ...  Work of Yan Huang and Jonathan Katz supported in part by NSF award #1111599. Work of Vladimir Kolesnikov supported in part by the Intelligence Advanced Research Project Activity (IARPA) via Department  ... 
doi:10.1007/978-3-662-44381-1_26 fatcat:jm36r6y5qvdx5atgfexkcnlpqm

General Secure Function Evaluation using standard trusted computing hardware

S. R. Tate, R. Vishwanathan
2011 2011 Ninth Annual International Conference on Privacy, Security and Trust  
This paper describes the specific changes that need to be made, and shows that the efficiency of TPM-based SFE is comparable to prior SFE solutions that are based on garbled circuits.  ...  In this paper, we show how Trusted Platform Modules (TPMs), standard security hardware devices, can be used with minor modification to efficiently support Secure Function Evaluation (SFE), a fundamental  ...  time-sensitive circuit evaluation uses standard non-TPM garbled circuit evaluation running at full speed on the CPU.  ... 
doi:10.1109/pst.2011.5971987 dblp:conf/pst/TateV11 fatcat:77hesaoqrvghbi3t4dseaoqw7a

A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design

Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider
2013 Journal of Computer Security  
., garbled circuits and (additively) homomorphic encryption.  ...  Today, SFE is a subject of immense amount of research in a variety of directions and is not easy to navigate.  ...  This work was supported in part by the European Commission through the ICT program under contract 216676 ECRYPT II and 216499 CACE, by the German Federal Ministry of Education and Research (BMBF) within  ... 
doi:10.3233/jcs-130464 fatcat:h3e2udfufrcetpf2pbzz6z6mru

Garbled Circuits as Randomized Encodings of Functions: a Primer [chapter]

Benny Applebaum
2017 Tutorials on the Foundations of Cryptography  
In this tutorial, we study garbled circuits from a foundational point of view under the framework of randomized encoding (RE) of Functions.  ...  Yao's garbled circuit (GC) construction is a central cryptographic tool with numerous applications.  ...  Under the decisional Diffie-Hellman assumption (DDH), the RSA assumption, or the Learning-with-Errors assumption (LWE), the class of polynomial-size circuits admits an RE with online rate 1+o(1) and with  ... 
doi:10.1007/978-3-319-57048-8_1 fatcat:hb2wsmjvvbgx7i62r6ibpv6jiu

Twin Clouds: Secure Cloud Computing with Low Latency [chapter]

Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sadeghi, Thomas Schneider
2011 Lecture Notes in Computer Science  
We split our protocols such that the Trusted Cloud performs security-critical precomputations in the setup phase, while the Commodity Cloud computes the time-critical query in parallel under encryption  ...  However, existing approaches for provably secure outsourcing of data and arbitrary computations are either based on tamper-proof hardware or fully homomorphic encryption.  ...  This work was in part funded in part by the European Commission through the ICT program under contract 257243 TClouds and 216676 ECRYPT II.  ... 
doi:10.1007/978-3-642-24712-5_3 fatcat:hlhej2sgk5gajd3l2m4mfwlnby

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries [chapter]

Yehuda Lindell, Benny Pinkas, Nigel P. Smart
2008 Lecture Notes in Computer Science  
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13] .  ...  In addition we show that there is little benefit in replacing subcomponents secure in the standard model with those which are only secure in the random oracle model.  ...  of the best ROM based scheme is often twice as fast as the best known standard model scheme.  ... 
doi:10.1007/978-3-540-85855-3_2 fatcat:vg54vwb3bvbz7j65y7mg442iuq

Non-Interactive Secure Computation Based on Cut-and-Choose [chapter]

Arash Afshar, Payman Mohassel, Benny Pinkas, Ben Riva
2014 Lecture Notes in Computer Science  
The protocol requires only t garbled circuits for achieving cheating probability of 2 −t , similar to the recent result of Lindell (Crypto 2013), but only needs a single round of interaction.  ...  In recent years it was shown that the theoretical framework of secure two-party computation can be efficiently implemented and can be run in reasonable time, even under the strongest security guarantees  ...  We thank an anonymous EUROCRYPT reviewer for suggesting a simplification of the cheating-recovery commitments.  ... 
doi:10.1007/978-3-642-55220-5_22 fatcat:bcpd5vnawrd4rdjzfpn4o7jdma
« Previous Showing results 1 — 15 out of 738 results