Amortizing Garbled Circuits (English)
Free access
- New search for: Huang, Yan
- New search for: Katz, Jonathan
- New search for: Kolesnikov, Vladimir
- New search for: Kumaresan, Ranjit
- New search for: Malozemoff, Alex J.
- New search for: Huang, Yan
- New search for: Katz, Jonathan
- New search for: Kolesnikov, Vladimir
- New search for: Kumaresan, Ranjit
- New search for: Malozemoff, Alex J.
In:
Advances in Cryptology – CRYPTO 2014
11
;
458-475
;
2014
- Article/Chapter (Book) / Electronic Resource
-
Title:Amortizing Garbled Circuits
-
Contributors:Huang, Yan ( author ) / Katz, Jonathan ( author ) / Kolesnikov, Vladimir ( author ) / Kumaresan, Ranjit ( author ) / Malozemoff, Alex J. ( author )
-
Published in:Advances in Cryptology – CRYPTO 2014 , 11 ; 458-475Lecture Notes in Computer Science ; 8617, 11 ; 458-475
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2014-01-01
-
Size:18 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Quantum Position Verification in the Random Oracle ModelUnruh, Dominique et al. | 2014
- 19
-
Single-Shot Security for One-Time Memories in the Isolated Qubits ModelLiu, Yi-Kai et al. | 2014
- 37
-
How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGsDodis, Yevgeniy / Shamir, Adi / Stephens-Davidowitz, Noah / Wichs, Daniel et al. | 2014
- 55
-
Cryptography with Streaming AlgorithmsPapakonstantinou, Periklis A. / Yang, Guang et al. | 2014
- 71
-
The Impossibility of Obfuscation with Auxiliary Input or a Universal SimulatorBitansky, Nir / Canetti, Ran / Cohn, Henry / Goldwasser, Shafi / Kalai, Yael Tauman / Paneth, Omer / Rosen, Alon et al. | 2014
- 90
-
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its ApplicationsYamakawa, Takashi / Yamada, Shota / Hanaoka, Goichiro / Kunihiro, Noboru et al. | 2014
- 108
-
On Virtual Grey Box Obfuscation for General CircuitsBitansky, Nir / Canetti, Ran / Kalai, Yael Tauman / Paneth, Omer et al. | 2014
- 126
-
Breaking ‘128-bit Secure’ Supersingular Binary CurvesGranger, Robert / Kleinjung, Thorsten / Zumbrägel, Jens et al. | 2014
- 146
-
Leakage-Tolerant Computation with Input-Independent PreprocessingBitansky, Nir / Dachman-Soled, Dana / Lin, Huijia et al. | 2014
- 164
-
Interactive Proofs under Continual Memory LeakageAnanth, Prabhanjan / Goyal, Vipul / Pandey, Omkant et al. | 2014
- 183
-
Amplifying Privacy in Privacy AmplificationAggarwal, Divesh / Dodis, Yevgeniy / Jafargholi, Zahra / Miles, Eric / Reyzin, Leonid et al. | 2014
- 199
-
On the Communication Complexity of Secure ComputationData, Deepesh / Prabhakaran, Manoj M. / Prabhakaran, Vinod M. et al. | 2014
- 217
-
Optimal Non-perfect Uniform Secret Sharing SchemesFarràs, Oriol / Hansen, Torben / Kaced, Tarik / Padró, Carles et al. | 2014
- 235
-
Proving the TLS Handshake Secure (As It Is)Bhargavan, Karthikeyan / Fournet, Cédric / Kohlweiss, Markulf / Pironti, Alfredo / Strub, Pierre-Yves / Zanella-Béguelin, Santiago et al. | 2014
- 256
-
Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile EnvironmentCamenisch, Jan / Lehmann, Anja / Lysyanskaya, Anna / Neven, Gregory et al. | 2014
- 276
-
Scalable Zero Knowledge via Cycles of Elliptic CurvesBen-Sasson, Eli / Chiesa, Alessandro / Tromer, Eran / Virza, Madars et al. | 2014
- 295
-
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear SubspacesJutla, Charanjit S. / Roy, Arnab et al. | 2014
- 313
-
Physical Zero-Knowledge Proofs of Physical PropertiesFisch, Ben / Freund, Daniel / Naor, Moni et al. | 2014
- 337
-
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed ComplexityCanetti, Ran / Jain, Abhishek / Paneth, Omer et al. | 2014
- 351
-
Round-Efficient Black-Box Construction of Composable Multi-Party ComputationKiyoshima, Susumu et al. | 2014
- 369
-
Secure Multi-Party Computation with Identifiable AbortIshai, Yuval / Ostrovsky, Rafail / Zikas, Vassilis et al. | 2014
- 387
-
Non-Interactive Secure Multiparty ComputationBeimel, Amos / Gabizon, Ariel / Ishai, Yuval / Kushilevitz, Eyal / Meldgaard, Sigurd / Paskin-Cherniavsky, Anat et al. | 2014
- 405
-
Feasibility and Infeasibility of Secure Computation with Malicious PUFsDachman-Soled, Dana / Fleischhacker, Nils / Katz, Jonathan / Lysyanskaya, Anna / Schröder, Dominique et al. | 2014
- 421
-
How to Use Bitcoin to Design Fair ProtocolsBentov, Iddo / Kumaresan, Ranjit et al. | 2014
- 440
-
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XORKolesnikov, Vladimir / Mohassel, Payman / Rosulek, Mike et al. | 2014
- 458
-
Amortizing Garbled CircuitsHuang, Yan / Katz, Jonathan / Kolesnikov, Vladimir / Kumaresan, Ranjit / Malozemoff, Alex J. et al. | 2014
- 476
-
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch SettingsLindell, Yehuda / Riva, Ben et al. | 2014
- 495
-
Dishonest Majority Multi-Party Computation for Binary CircuitsLarraia, Enrique / Orsini, Emmanuela / Smart, Nigel P. et al. | 2014
- 513
-
Efficient Three-Party Computation from Cut-and-ChooseChoi, Seung Geol / Katz, Jonathan / Malozemoff, Alex J. / Zikas, Vassilis et al. | 2014