Theory of Cryptography
Springer Berlin (Verlag)
978-3-642-00456-8 (ISBN)
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.
Erscheint lt. Verlag | 25.2.2009 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
Zusatzinfo | XIV, 618 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 935 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | adaptive security • algorithm • Algorithm analysis and problem complexity • algorithms • authentication • black-box reductions • Cisco • communication complexity • Complexity • cryptographic paradigms • cryptographic primitives • cryptographic protocols • cryptography • Cryptology • digital signature schemes • Distributed Computing • Encryption • Error-correction • fault localization • Game Theory • Hardcover, Softcover / Informatik, EDV/Informatik • information-theoretic security • interactive hashing • Lower Bounds • multicast encryption • Multi-Party Computation • network routing • obfuscation • oblivious transfer • privacy • pseudo-random functions • public key encryption • Search • Secret Sharing • secure computation • security • Shannon • Zero Knowledge |
ISBN-10 | 3-642-00456-3 / 3642004563 |
ISBN-13 | 978-3-642-00456-8 / 9783642004568 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich