Founding Cryptography on Oblivious Transfer – Efficiently (Englisch)
Freier Zugriff
- Neue Suche nach: Ishai, Yuval
- Neue Suche nach: Prabhakaran, Manoj
- Neue Suche nach: Sahai, Amit
- Neue Suche nach: Ishai, Yuval
- Neue Suche nach: Prabhakaran, Manoj
- Neue Suche nach: Sahai, Amit
In:
Advances in Cryptology – CRYPTO 2008
10
;
572-591
;
2008
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Founding Cryptography on Oblivious Transfer – Efficiently
-
Beteiligte:
-
Erschienen in:Advances in Cryptology – CRYPTO 2008 , 10 ; 572-591Lecture Notes in Computer Science ; 5157, 10 ; 572-591
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.2008
-
Format / Umfang:20 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
The Random Oracle Model and the Ideal Cipher Model Are EquivalentCoron, Jean-Sébastien / Patarin, Jacques / Seurin, Yannick et al. | 2008
- 2
-
Programmable Hash Functions and Their ApplicationsHofheinz, Dennis / Kiltz, Eike et al. | 2008
- 3
-
One-Time ProgramsGoldwasser, Shafi / Kalai, Yael Tauman / Rothblum, Guy N. et al. | 2008
- 57
-
Adaptive One-Way Functions and ApplicationsPandey, Omkant / Pass, Rafael / Vaikuntanathan, Vinod et al. | 2008
- 75
-
Bits Security of the Elliptic Curve Diffie–Hellman Secret KeysJetchev, Dimitar / Venkatesan, Ramarathnam et al. | 2008
- 6
-
Improved Bounds on Security Reductions for Discrete Log Based SignaturesGarg, Sanjam / Bhaskar, Raghav / Lokam, Satyanarayana V. et al. | 2008
- 108
-
Circular-Secure Encryption from Decision Diffie-HellmanBoneh, Dan / Halevi, Shai / Hamburg, Mike / Ostrovsky, Rafail et al. | 2008
- 126
-
Public-Key Locally-Decodable CodesHemenway, Brett / Ostrovsky, Rafail et al. | 2008
- 9
-
Key-Recovery Attacks on Universal Hash Function Based MAC AlgorithmsHandschuh, Helena / Preneel, Bart et al. | 2008
- 10
-
Cryptanalysis of the GOST Hash FunctionMendel, Florian / Pramstaller, Norbert / Rechberger, Christian / Kontak, Marcin / Szmidt, Janusz et al. | 2008
- 179
-
Preimages for Reduced SHA-0 and SHA-1Cannière, Christophe / Rechberger, Christian et al. | 2008
- 12
-
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping SchemeEisenbarth, Thomas / Kasper, Timo / Moradi, Amir / Paar, Christof / Salmasizadeh, Mahmoud / Shalmani, Mohammad T. Manzuri et al. | 2008
- 13
-
Bug AttacksBiham, Eli / Carmeli, Yaniv / Shamir, Adi et al. | 2008
- 241
-
Scalable Multiparty Computation with Nearly Optimal Work and ResilienceDamgård, Ivan / Ishai, Yuval / Krøigaard, Mikkel / Nielsen, Jesper Buus / Smith, Adam et al. | 2008
- 262
-
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and SeparationsPrabhakaran, Manoj / Rosulek, Mike et al. | 2008
- 280
-
Cryptanalysis of MinRankFaugère, Jean-Charles / Levy-dit-Vehel, Françoise / Perret, Ludovic et al. | 2008
- 17
-
New State Recovery Attack on RC4Maximov, Alexander / Khovratovich, Dmitry et al. | 2008
- 317
-
Dynamic Threshold Public-Key EncryptionDelerablée, Cécile / Pointcheval, David et al. | 2008
- 19
-
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random OraclesBoldyreva, Alexandra / Fehr, Serge / O’Neill, Adam et al. | 2008
- 20
-
Deterministic Encryption: Definitional Equivalences and Constructions without Random OraclesBellare, Mihir / Fischlin, Marc / O’Neill, Adam / Ristenpart, Thomas et al. | 2008
- 379
-
Communication Complexity in Algebraic Two-Party ProtocolsOstrovsky, Rafail / Skeith, William E. III et al. | 2008
- 22
-
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression FunctionsStam, Martijn et al. | 2008
- 23
-
Compression from Collisions, or Why CRHF Combiners Have a Long OutputPietrzak, Krzysztof et al. | 2008
- 24
-
Constructing Cryptographic Hash Functions from Fixed-Key BlockciphersRogaway, Phillip / Steinberger, John et al. | 2008
- 25
-
Distributed Private Data Analysis: Simultaneously Solving How and WhatBeimel, Amos / Nissim, Kobbi / Omri, Eran et al. | 2008
- 469
-
New Efficient Attacks on Statistical Disclosure Control MechanismsDwork, Cynthia / Yekhanin, Sergey et al. | 2008
- 481
-
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded AdversariesMohassel, Payman / Weinreb, Enav et al. | 2008
- 28
-
Collusion-Free Protocols in the Mediated ModelAlwen, Joël / Shelat, Abhi / Visconti, Ivan et al. | 2008
- 515
-
Efficient Constructions of Composable Commitments and Zero-Knowledge ProofsDodis, Yevgeniy / Shoup, Victor / Walfish, Shabsi et al. | 2008
- 536
-
Noninteractive Statistical Zero-Knowledge Proofs for Lattice ProblemsPeikert, Chris / Vaikuntanathan, Vinod et al. | 2008
- 554
-
A Framework for Efficient and Composable Oblivious TransferPeikert, Chris / Vaikuntanathan, Vinod / Waters, Brent et al. | 2008
- 572
-
Founding Cryptography on Oblivious Transfer – EfficientlyIshai, Yuval / Prabhakaran, Manoj / Sahai, Amit et al. | 2008