Vor Ort
Merkzettel Warenkorb
  • Produktbild: Theory of Cryptography
  • Produktbild: Theory of Cryptography
Band 5444

Theory of Cryptography Sixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings

Aus der Reihe Security and Cryptology

97,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.02.2009

Abbildungen

XIV, 618 p.

Herausgeber

Omer Reingold

Verlag

Springer Berlin

Seitenzahl

618

Maße (L/B/H)

23,5/15,5/3,4 cm

Gewicht

937 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-642-00456-8

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.02.2009

Abbildungen

XIV, 618 p.

Herausgeber

Omer Reingold

Verlag

Springer Berlin

Seitenzahl

618

Maße (L/B/H)

23,5/15,5/3,4 cm

Gewicht

937 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-642-00456-8

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Theory of Cryptography
  • Produktbild: Theory of Cryptography
  • An Optimally Fair Coin Toss.- Complete Fairness in Multi-party Computation without an Honest Majority.- Fairness with an Honest Minority and a Rational Majority.- Purely Rational Secret Sharing (Extended Abstract).- Some Recent Progress in Lattice-Based Cryptography.- Non-malleable Obfuscation.- Simulation-Based Concurrent Non-malleable Commitments and Decommitments.- Proofs of Retrievability via Hardness Amplification.- Security Amplification for Interactive Cryptographic Primitives.- Composability and On-Line Deniability of Authentication.- Authenticated Adversarial Routing.- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.- On the (Im)Possibility of Key Dependent Encryption.- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.- Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security.- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.- Realistic Failures in Secure Multi-party Computation.- Secure Arithmetic Computation with No Honest Majority.- Universally Composable Multiparty Computation with Partially Isolated Parties.- Oblivious Transfer from Weak Noisy Channels.- Composing Quantum Protocols in a Classical Environment.- LEGO for Two-Party Secure Computation.- Simple, Black-Box Constructions of Adaptively Secure Protocols.- Black-Box Constructions of Two-Party Protocols from One-Way Functions.- Chosen-Ciphertext Security via Correlated Products.- Hierarchical Identity Based Encryption with Polynomially Many Levels.- Predicate Privacy in Encryption Systems.- Simultaneous Hardcore Bits and Cryptography against Memory Attacks.- The Differential Privacy Frontier (Extended Abstract).- How Efficient Can Memory Checking Be?.- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms.- Secret Sharing and Non-Shannon Information Inequalities.- Weak Verifiable Random Functions.- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection.- Towards a Theory of Extractable Functions.