Skip header Section
Skip Bibliometrics Section
Modern Cryptography, Probabilistic Proofs, and PseudorandomnessNovember 1998
- Author:
- Oded Goldreich,
- Editors:
- R. L. Graham,
- B. Korte
Skip Abstract Section
Abstract
From the Publisher:
This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.
Cited By
Kalai Y, Raz R and Rothblum R (2022). How to Delegate Computations: The Power of No-Signaling Proofs, Journal of the ACM, 69:1, (1-82), Online publication date: 28-Feb-2022.- Reingold O, Rothblum G and Rothblum R Efficient batch verification for UP Proceedings of the 33rd Computational Complexity Conference, (1-23)
- Ahmad H, Wang L, Hong H, Li J, Dawood H, Ahmed M and Yang Y (2018). Primitives towards verifiable computation, Frontiers of Computer Science: Selected Publications from Chinese Universities, 12:3, (451-478), Online publication date: 1-Jun-2018.
- Cramer R, Damgård I, Döttling N, Giacomelli I and Xing C Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model Information Theoretic Security, (1-25)
- Minematsu K Efficient Message Authentication Codes with Combinatorial Group Testing Computer Security -- ESORICS 2015, (185-202)
- Goldwasser S, Kalai Y and Rothblum G (2015). Delegating Computation, Journal of the ACM, 62:4, (1-64), Online publication date: 11-Sep-2015.
- Crubille R and Dal Lago U Metric reasoning about λ-terms Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (633-644)
- Scheibler R, Haghighatshoar S and Vetterli M (2015). A Fast Hadamard Transform for Signals With Sublinear Sparsity in the Transform Domain, IEEE Transactions on Information Theory, 61:4, (2115-2132), Online publication date: 1-Apr-2015.
- Pass R and Venkitasubramaniam M (2012). A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs, ACM Transactions on Computation Theory, 4:4, (1-22), Online publication date: 1-Nov-2012.
- Sachan M and Bhattacharya A (2012). Mining statistically significant substrings using the chi-square statistic, Proceedings of the VLDB Endowment, 5:10, (1052-1063), Online publication date: 1-Jun-2012.
- Baignères T, Sepehrdad P and Vaudenay S Distinguishing distributions using Chernoff information Proceedings of the 4th international conference on Provable security, (144-165)
- Hall R and Fienberg S Privacy-preserving record linkage Proceedings of the 2010 international conference on Privacy in statistical databases, (269-283)
- Håstad J, Pass R, Wikström D and Pietrzak K An efficient parallel repetition theorem Proceedings of the 7th international conference on Theory of Cryptography, (1-18)
- Bresciani R and Butterfield A Weakening the Dolev-Yao model through probability Proceedings of the 2nd international conference on Security of information and networks, (293-297)
- Halprin R and Naor M Games for extracting randomness Proceedings of the 5th Symposium on Usable Privacy and Security, (1-12)
- Sudan M (2009). Probabilistically checkable proofs, Communications of the ACM, 52:3, (76-84), Online publication date: 1-Mar-2009.
- Wigderson A Randomness Proceedings of the 3rd international conference on Computer science: theory and applications, (1-2)
- Shaltiel R and Viola E Hardness amplification proofs require majority Proceedings of the fortieth annual ACM symposium on Theory of computing, (589-598)
- Halevi S, Myers S and Rackoff C On seed-incompressible functions Proceedings of the 5th conference on Theory of cryptography, (19-36)
- Minematsu K and Matsushima T Tweakable enciphering schemes from hash-sum-expansion Proceedings of the cryptology 8th international conference on Progress in cryptology, (252-267)
- Minematsu K and Matsushima T (2007). Improved MACs from Differentially-Uniform Permutations, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:12, (2908-2915), Online publication date: 1-Dec-2007.
- Vadhan S (2007). The unified theory of pseudorandomness, ACM SIGACT News, 38:3, (39-54), Online publication date: 1-Sep-2007.
- Shaltiel R and Umans C Low-end uniform hardness vs. randomness tradeoffs for AM Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (430-439)
- Gradwohl R, Naor M, Pinkas B and Rothblum G Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles Proceedings of the 4th international conference on Fun with algorithms, (166-182)
- Katos V and Doherty B (2007). Exploring confusion in product ciphers through regression analysis, Information Sciences: an International Journal, 177:8, (1789-1795), Online publication date: 20-Apr-2007.
- Minematsu K and Matsushima T New bounds for PMAC, TMAC, and XCBC Proceedings of the 14th international conference on Fast Software Encryption, (434-451)
- Awerbuch B and Scheideler C Robust random number generation for peer-to-peer systems Proceedings of the 10th international conference on Principles of Distributed Systems, (275-289)
- Healy A Randomness-efficient sampling within NC1 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, (398-409)
- Minematsu K Improved security analysis of XEX and LRW modes Proceedings of the 13th international conference on Selected areas in cryptography, (96-113)
- Lobo A and Baliga G (2006). NP-completeness for all computer science undergraduates, Journal of Computing Sciences in Colleges, 21:6, (53-63), Online publication date: 1-Jun-2006.
- Katz J and Shin J Parallel and concurrent security of the HB and HB+ protocols Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (73-87)
- Wigderson A The power and weakness of randomness in computation Proceedings of the 7th Latin American conference on Theoretical Informatics, (28-29)
- Minematsu K and Tsunoo Y Provably secure MACs from differentially-uniform permutations and AES-Based implementations Proceedings of the 13th international conference on Fast Software Encryption, (226-241)
- Healy A and Viola E Constant-Depth circuits for arithmetic in finite fields of characteristic two Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (672-683)
- Minematsu K and Tsunoo Y Hybrid symmetric encryption using known-plaintext attack-secure components Proceedings of the 8th international conference on Information Security and Cryptology, (242-260)
- Pucella R (2005). Logical verification and equational verification, ACM SIGACT News, 36:2, (77-88), Online publication date: 1-Jun-2005.
- Tsukada Y (2005). Interactive and Probabilistic Proof of Mobile Code Safety, Automated Software Engineering, 12:2, (237-257), Online publication date: 1-Apr-2005.
- Rubio J, Insua D, Rios J and Fernandez E Quixote Proceedings of the 2005 international conference on E-Government: towards Electronic Democracy, (225-234)
- Shaltiel R and Umans C (2005). Simple extractors for all min-entropies and a new pseudorandom generator, Journal of the ACM, 52:2, (172-216), Online publication date: 1-Mar-2005.
- Pucella R (2004). Specifying confidentiality, ACM SIGACT News, 35:4, (72-83), Online publication date: 1-Dec-2004.
- Naor M and Reingold O (2004). Number-theoretic constructions of efficient pseudo-random functions, Journal of the ACM, 51:2, (231-262), Online publication date: 1-Mar-2004.
- Fischer M and Merritt M (2003). Appraising two decades of distributed computing theory research, Distributed Computing, 16:2-3, (239-247), Online publication date: 1-Sep-2003.
- Backes M, Cachin C and Strobl R Proactive secure message transmission in asynchronous networks Proceedings of the twenty-second annual symposium on Principles of distributed computing, (223-232)
- Gal A and Rosen A Lower bounds on the amount of randomness in private computation Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (659-666)
- Loureiro S, Bussard L and Roudier Y Extending tamper-proof hardware security to untrusted execution environments Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5, (12-12)
- Provos N Defending against statistical steganalysis Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
- Trevisan L Non-approximability results for optimization problems on bounded degree instances Proceedings of the thirty-third annual ACM symposium on Theory of computing, (453-461)
- (2001). Extractors and pseudorandom generators, Journal of the ACM, 48:4, (860-879), Online publication date: 1-Jul-2001.
- Crescenzo G, Ishai Y and Ostrovsky R (2001). Universal Service-Providers for Private Information Retrieval, Journal of Cryptology, 14:1, (37-74), Online publication date: 1-Jan-2001.
- Goldmann M, Näslund M and Russell A (2001). Complexity Bounds on General Hard-Core Predicates, Journal of Cryptology, 14:3, (177-195), Online publication date: 1-Jan-2001.
- Provos N Encrypting virtual memory Proceedings of the 9th conference on USENIX Security Symposium - Volume 9, (3-3)
- Naor M, Reingold O and Rosen A Pseudo-random functions and factoring (extended abstract) Proceedings of the thirty-second annual ACM symposium on Theory of computing, (11-20)
- Impagliazzo R, Shaltiel R and Wigderson A Extractors and pseudo-random generators with optimal seed length Proceedings of the thirty-second annual ACM symposium on Theory of computing, (1-10)
- Sudan M, Trevisan L and Vadhan S Pseudorandom generators without the XOR Lemma (extended abstract) Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (537-546)
- Trevisan L Construction of extractors using pseudo-random generators (extended abstract) Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (141-148)
- Cramer R Introduction to Secure Computation Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998, (16-62)
Recommendations
Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
Affine message authentication code (MAC) and delegatable affine MAC turn out to be useful tools for constructing identity-based encryption (IBE) and hierarchical IBE (HIBE), as shown in Blazy, Kiltz and Pan's (BKP) creative work in CRYPTO (2014). An ...
Symbolic Proofs for Lattice-Based Cryptography
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications SecuritySymbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions in the computational model. However, existing ...