↓ Skip to main content

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 On Basing Size-Verifiable One-Way Functions on NP-Hardness
  3. Altmetric Badge
    Chapter 2 The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions
  4. Altmetric Badge
    Chapter 3 The Power of Negations in Cryptography
  5. Altmetric Badge
    Chapter 4 From Weak to Strong Zero-Knowledge and Applications
  6. Altmetric Badge
    Chapter 5 An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
  7. Altmetric Badge
    Chapter 6 On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
  8. Altmetric Badge
    Chapter 7 A Little Honesty Goes a Long Way
  9. Altmetric Badge
    Chapter 8 Topology-Hiding Computation
  10. Altmetric Badge
    Chapter 9 Secure Physical Computation Using Disposable Circuits
  11. Altmetric Badge
    Chapter 10 Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
  12. Altmetric Badge
    Chapter 11 Richer Efficiency/Security Trade-offs in 2PC
  13. Altmetric Badge
    Chapter 12 Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
  14. Altmetric Badge
    Chapter 13 An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting
  15. Altmetric Badge
    Chapter 14 General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
  16. Altmetric Badge
    Chapter 15 Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
  17. Altmetric Badge
    Chapter 16 A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
  18. Altmetric Badge
    Chapter 17 Leakage-Resilient Non-malleable Codes
  19. Altmetric Badge
    Chapter 18 Locally Decodable and Updatable Non-malleable Codes and Their Applications
  20. Altmetric Badge
    Chapter 19 Tamper Detection and Continuous Non-malleable Codes
  21. Altmetric Badge
    Chapter 20 Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
  22. Altmetric Badge
    Chapter 21 Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
  23. Altmetric Badge
    Chapter 22 From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
  24. Altmetric Badge
    Chapter 23 Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms
  25. Altmetric Badge
    Chapter 24 Non-committing Encryption from Φ-hiding
  26. Altmetric Badge
    Chapter 25 On the Regularity of Lossy RSA
  27. Altmetric Badge
    Chapter 26 Tightly-Secure Authenticated Key Exchange
Attention for Chapter 7: A Little Honesty Goes a Long Way
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
31 Mendeley
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.
Chapter title
A Little Honesty Goes a Long Way
Chapter number 7
Book title
Theory of Cryptography
Published in
Lecture notes in computer science, January 2015
DOI 10.1007/978-3-662-46494-6_7
Book ISBNs
978-3-66-246493-9, 978-3-66-246494-6
Authors

Garay, Juan A., Gelles, Ran, Johnson, David S., Kiayias, Aggelos, Yung, Moti, Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung

Editors

Yevgeniy Dodis, Jesper Buus Nielsen

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 31 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 31 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 11 35%
Student > Master 4 13%
Other 3 10%
Student > Doctoral Student 2 6%
Lecturer 2 6%
Other 6 19%
Unknown 3 10%
Readers by discipline Count As %
Computer Science 19 61%
Mathematics 3 10%
Physics and Astronomy 2 6%
Biochemistry, Genetics and Molecular Biology 1 3%
Engineering 1 3%
Other 1 3%
Unknown 4 13%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 27 April 2015.
All research outputs
#18,407,102
of 22,800,560 outputs
Outputs from Lecture notes in computer science
#6,007
of 8,125 outputs
Outputs of similar age
#255,806
of 353,066 outputs
Outputs of similar age from Lecture notes in computer science
#198
of 257 outputs
Altmetric has tracked 22,800,560 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,125 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 353,066 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 16th percentile – i.e., 16% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 257 others from the same source and published within six weeks on either side of this one. This one is in the 16th percentile – i.e., 16% of its contemporaries scored the same or lower than it.