↓ Skip to main content
What is this page? Embed badge

Theory of Cryptography

Overview of attention for book
Cover of 'Theory of Cryptography'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Overcoming Weak Expectations
  3. Altmetric Badge
    Chapter 2 A Counterexample to the Chain Rule for Conditional HILL Entropy
  4. Altmetric Badge
    Chapter 3 Hardness Preserving Reductions via Cuckoo Hashing
  5. Altmetric Badge
    Chapter 4 Concurrent Zero Knowledge in the Bounded Player Model
  6. Altmetric Badge
    Chapter 5 Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
  7. Altmetric Badge
    Chapter 6 Succinct Malleable NIZKs and an Application to Compact Shuffles
  8. Altmetric Badge
    Chapter 7 Encrypted Messages from the Heights of Cryptomania
  9. Altmetric Badge
    Chapter 8 Theory of Cryptography
  10. Altmetric Badge
    Chapter 9 When Homomorphism Becomes a Liability
  11. Altmetric Badge
    Chapter 10 Garbling XOR Gates “For Free” in the Standard Model
  12. Altmetric Badge
    Chapter 11 Why “Fiat-Shamir for Proofs” Lacks a Proof
  13. Altmetric Badge
    Chapter 12 On the (In)security of Fischlin’s Paradigm
  14. Altmetric Badge
    Chapter 13 Signatures of Correct Computation
  15. Altmetric Badge
    Chapter 14 A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
  16. Altmetric Badge
    Chapter 15 Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
  17. Altmetric Badge
    Chapter 16 Feasibility and Completeness of Cryptographic Tasks in the Quantum World
  18. Altmetric Badge
    Chapter 17 Languages with Efficient Zero-Knowledge PCPs are in SZK
  19. Altmetric Badge
    Chapter 18 Succinct Non-interactive Arguments via Linear Interactive Proofs
  20. Altmetric Badge
    Chapter 19 Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
  21. Altmetric Badge
    Chapter 20 Secure Computation for Big Data
  22. Altmetric Badge
    Chapter 21 Communication Locality in Secure Multi-party Computation
  23. Altmetric Badge
    Chapter 22 Distributed Oblivious RAM for Secure Two-Party Computation
  24. Altmetric Badge
    Chapter 23 Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
  25. Altmetric Badge
    Chapter 24 Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy
  26. Altmetric Badge
    Chapter 25 Limits on the Usefulness of Random Oracles
  27. Altmetric Badge
    Chapter 26 Analyzing Graphs with Node Differential Privacy
  28. Altmetric Badge
    Chapter 27 Universally Composable Synchronous Computation
  29. Altmetric Badge
    Chapter 28 Multi-Client Non-interactive Verifiable Computation
  30. Altmetric Badge
    Chapter 29 On the Feasibility of Extending Oblivious Transfer
  31. Altmetric Badge
    Chapter 30 Computational Soundness of Coinductive Symbolic Security under Active Attacks
  32. Altmetric Badge
    Chapter 31 Revisiting Lower and Upper Bounds for Selective Decommitments
  33. Altmetric Badge
    Chapter 32 On the Circular Security of Bit-Encryption
  34. Altmetric Badge
    Chapter 33 Cryptographic Hardness of Random Local Functions–Survey
  35. Altmetric Badge
    Chapter 34 On the Power of Correlated Randomness in Secure Computation
  36. Altmetric Badge
    Chapter 35 Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
  37. Altmetric Badge
    Chapter 36 Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
  38. Altmetric Badge
    Chapter 37 A Cookbook for Black-Box Separations and a Recipe for UOWHFs
  39. Altmetric Badge
    Chapter 38 Algebraic (Trapdoor) One-Way Functions and Their Applications
  40. Altmetric Badge
    Chapter 39 Randomness-Dependent Message Security
  41. Altmetric Badge
    Chapter 40 Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
  42. Altmetric Badge
    Chapter 41 Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
patent
1 patent

Readers on

mendeley
13 Mendeley
Summary X Patents
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Theory of Cryptography
Published by
Springer Berlin Heidelberg, February 2013
DOI 10.1007/978-3-642-36594-2
ISBNs
978-3-64-236593-5, 978-3-64-236594-2
Editors

Sahai, Amit

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
 Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 13 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 38%
Student > Master 3 23%
Student > Postgraduate 2 15%
Researcher 2 15%
Student > Doctoral Student 1 8%
Other 1 8%
Readers by discipline Count As %
Computer Science 8 62%
Engineering 2 15%
Mathematics 1 8%
Physics and Astronomy 1 8%
Design 1 8%
Other 0 0%

This page is provided by Altmetric.