Skip header Section
Skip Bibliometrics Section
Foundations of Cryptography: Volume 2, Basic ApplicationsSeptember 2009
- Author:
- Goldreich Oded
Skip Abstract Section
Abstract
Cryptography is concerned with the conceptualization, definition, and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Building on the basic tools presented in the first volume, this second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful. Also available: Volume I: Basic Tools 0-521-79172-3 Hardback $75.00 C
Cited By
- Nagano T and Anada H Finsler Encryption Information Security and Cryptology – ICISC 2023, (194-213)
Sang Y, Luo N, Judson S, Chaimberg B, Antonopoulos T, Wang X, Piskac R and Shao Z Ou: Automating the Parallelization of Zero-Knowledge Protocols Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, (534-548)- Culnane C, Boureanu I, Snyman J, Wesemeyer S and Treharne H Formalising Application-Driven Authentication & Access-Control based on Users’ Companion Devices Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, (884-898)
- Liao M, Golab W and Zahedi S IRS: An Incentive-compatible Reward Scheme for Algorand Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (661-669)
- Koti N, Kukkala V, Patra A and Raj Gopal B Shield: Secure Allegation Escrow System with Stronger Guarantees Proceedings of the ACM Web Conference 2023, (2252-2262)
- Klinger A and Meyer U Privacy-Preserving Fully Online Matching with Deadlines Proceedings of the Thirteenth ACM Conference on Data and Application Security and Privacy, (105-116)
- Klinger A, Battermann F and Meyer U Anonymous System for Fully Distributed and Robust Secure Multi-Party Computation Proceedings of the Thirteenth ACM Conference on Data and Application Security and Privacy, (129-139)
- Choudhury A and Patra A (2023). On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience, Journal of Cryptology, 36:2, Online publication date: 1-Apr-2023.
- Appan A, Chandramouli A and Choudhury A Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries Progress in Cryptology – INDOCRYPT 2022, (223-248)
- Ranchal-Pedrosa A and Gramoli V Leveraging Democracy to Optimize Distributed Random Beacons Proceedings of the 2022 ACM Workshop on Developments in Consensus, (15-27)
- Roy Chowdhury A, Ding B, Jha S, Liu W and Zhou J Strengthening Order Preserving Encryption with Differential Privacy Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (2519-2533)
- Güneysu T, Hodges P, Land G, Ounsworth M, Stebila D and Zaverucha G Proof-of-Possession for KEM Certificates using Verifiable Generation Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (1337-1351)
- Humphries T, Akhavan Mahdavi R, Veitch S and Kerschbaum F Selective MPC Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (1459-1472)
- Bell J, Gascón A, Ghazi B, Kumar R, Manurangsi P, Raykova M and Schoppmann P Distributed, Private, Sparse Histograms in the Two-Server Model Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (307-321)
- Zhou A, Qiu R, Lambert T, Allard T, Ibrahim S and Abbadi A PGPregel Proceedings of the 13th Symposium on Cloud Computing, (386-402)
- Goren G, Moses Y and Spiegelman A Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement Proceedings of the 4th ACM Conference on Advances in Financial Technologies, (111-125)
- Ibarrondo A, Chabanne H, Despiegel V and Önen M Colmade: Collaborative Masking in Auditable Decryption for BFV-based Homomorphic Encryption Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security, (129-139)
- Wang C, Bater J, Nayak K and Machanavajjhala A IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy Proceedings of the 2022 International Conference on Management of Data, (818-832)
- Bai J, Song X, Cui S, Chang E and Russello G Scalable Private Decision Tree Evaluation with Sublinear Communication Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, (843-857)
- Alper H and Küpçü A (2021). Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation, ACM Transactions on Privacy and Security, 25:1, (1-34), Online publication date: 28-Feb-2022.
- Bartusek J Secure Quantum Computation with Classical Communication Theory of Cryptography, (1-30)
- Klinger A and Meyer U Towards Secure Evaluation of Online Functionalities Proceedings of the 16th International Conference on Availability, Reliability and Security, (1-14)
- Wang C, Bater J, Nayak K and Machanavajjhala A DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy Proceedings of the 2021 International Conference on Management of Data, (1892-1905)
- Nuida K Cryptographic Pseudorandom Generators Can Make Cryptosystems Problematic Public-Key Cryptography – PKC 2021, (441-468)
- Viola E (2021). AC0 Unpredictability, ACM Transactions on Computation Theory, 13:1, (1-8), Online publication date: 31-Mar-2021.
- Yang K, Wang X and Zhang J More Efficient MPC from Improved Triple Generation and Authenticated Garbling Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, (1627-1646)
- Yang K, Weng C, Lan X, Zhang J and Wang X Ferret: Fast Extension for Correlated OT with Small Communication Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, (1607-1626)
- Eckey L, Faust S and Schlosser B OptiSwap: Fast Optimistic Fair Exchange Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, (543-557)
- Krastnikov S, Kerschbaum F and Stebila D (2020). Efficient oblivious database joins, Proceedings of the VLDB Endowment, 13:12, (2132-2145), Online publication date: 1-Aug-2020.
- Roy Chowdhury A, Wang C, He X, Machanavajjhala A and Jha S Cryptϵ Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, (603-619)
- Hazay C, Shelat A and Venkitasubramaniam M Going Beyond Dual Execution: MPC for Functions with Efficient Verification Public-Key Cryptography – PKC 2020, (328-356)
- Patra A and Ravi D Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation Advances in Cryptology – ASIACRYPT 2019, (456-487)
- Morita H and Attrapadung N Client-Aided Two-Party Secure Interval Test Protocol Cryptology and Network Security, (328-343)
- Goyal R, Kim S, Manohar N, Waters B and Wu D Watermarking Public-Key Cryptographic Primitives Advances in Cryptology – CRYPTO 2019, (367-398)
- Hamlin A, Holmgren J, Weiss M and Wichs D On the Plausibility of Fully Homomorphic Encryption for RAMs Advances in Cryptology – CRYPTO 2019, (589-619)
- Aharonov D, Brakerski Z, Chung K, Green A, Lai C and Sattath O On Quantum Advantage in Information Theoretic Single-Server PIR Advances in Cryptology – EUROCRYPT 2019, (219-246)
- Hamlin A, Ostrovsky R, Weiss M and Wichs D Private Anonymous Data Access Advances in Cryptology – EUROCRYPT 2019, (244-273)
- Asharov G, Hubert Chan T, Nayak K, Pass R, Ren L and Shi E Locality-Preserving Oblivious RAM Advances in Cryptology – EUROCRYPT 2019, (214-243)
- Ananth P, Choudhuri A, Goel A and Jain A Two Round Information-Theoretic MPC with Malicious Security Advances in Cryptology – EUROCRYPT 2019, (532-561)
- Applebaum B, Brakerski Z and Tsabary R Degree 2 is Complete for the Round-Complexity of Malicious MPC Advances in Cryptology – EUROCRYPT 2019, (504-531)
- Chen Z, Che R, Zhong H, Tian M and Cui J (2019). PATH, Wireless Networks, 25:4, (1763-1776), Online publication date: 1-May-2019.
- Farinella G, Napoli C, Nicotra G and Riccobene S (2019). A context-driven privacy enforcement system for autonomous media capture devices, Multimedia Tools and Applications, 78:10, (14091-14108), Online publication date: 1-May-2019.
- Celik Z, Acar A, Aksu H, Sheatsley R, McDaniel P and Uluagac A Curie Proceedings of the Ninth ACM Conference on Data and Application Security and Privacy, (121-132)
- Parter M and Yogev E Distributed algorithms made secure Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (1693-1710)
- Sadat M, Al Aziz M, Mohammed N, Chen F, Jiang X and Wang S (2019). SAFETY, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16:1, (93-102), Online publication date: 1-Jan-2019.
- Hussain S, Riazi M and Koushanfar F (2018). SHAIP, ACM Transactions on Design Automation of Electronic Systems, 23:6, (1-20), Online publication date: 30-Nov-2018.
- Lu W and Sakuma J More Practical Privacy-Preserving Machine Learning as A Service via Efficient Secure Matrix Multiplication Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, (25-36)
- Morita H, Attrapadung N, Teruya T, Ohata S, Nuida K and Hanaoka G Constant-Round Client-Aided Secure Comparison Protocol Computer Security, (395-415)
- Li J, Liu A, Wang W, Li Z, Liu G, Zhao L and Zheng K Towards Privacy-Preserving Travel-Time-First Task Assignment in Spatial Crowdsourcing Web and Big Data, (19-34)
- Zhang Q, Wang C, Wu H, Xin C and Phuong T GELU-net Proceedings of the 27th International Joint Conference on Artificial Intelligence, (3933-3939)
- Cerulli A, De Cristofaro E and Soriente C Nothing Refreshes Like a RePSI: Reactive Private Set Intersection Applied Cryptography and Network Security, (280-300)
- Cheng K, Hou Y and Wang L Secure Similar Sequence Query on Outsourced Genomic Data Proceedings of the 2018 on Asia Conference on Computer and Communications Security, (237-251)
- Lu W, Zhou J and Sakuma J Non-interactive and Output Expressive Private Comparison from Homomorphic Encryption Proceedings of the 2018 on Asia Conference on Computer and Communications Security, (67-74)
- Aumüller M, Christiani T, Pagh R and Silvestri F Distance-Sensitive Hashing Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (89-104)
- Wang H, He D, Sun Y, Kumar N and Choo K (2018). PAT, Future Generation Computer Systems, 79:P1, (262-270), Online publication date: 1-Feb-2018.
- Xue K, Li S, Hong J, Xue Y, Yu N and Hong P (2017). Two-Cloud Secure Database for Numeric-Related SQL Range Queries With Privacy Preserving, IEEE Transactions on Information Forensics and Security, 12:7, (1596-1608), Online publication date: 1-Jul-2017.
- Antignac T, Mukelabai M and Schneider G Specification, design, and verification of an accountability-aware surveillance protocol Proceedings of the Symposium on Applied Computing, (1372-1378)
- Wang Z, Cheung S and Luo Y (2017). Information-Theoretic Secure Multi-Party Computation With Collusion Deterrence, IEEE Transactions on Information Forensics and Security, 12:4, (980-995), Online publication date: 1-Apr-2017.
- Fuchsbauer G, Gay R, Kowalczyk L and Orlandi C Access Control Encryption for Equality, Comparison, and More Proceedings, Part II, of the 20th IACR International Conference on Public-Key Cryptography --- PKC 2017 - Volume 10175, (88-118)
- Foerg F, Wetzel S and Meyer U Efficient Commodity Matching for Privacy-Preserving Two-Party Bartering Proceedings of the Seventh ACM on Conference on Data and Application Security and Privacy, (107-114)
- Rahman M, Manshaei M, Al-Shaer E and Shehab M (2017). Secure and Private Data Aggregation for Energy Consumption Scheduling in Smart Grids, IEEE Transactions on Dependable and Secure Computing, 14:2, (221-234), Online publication date: 1-Mar-2017.
- Peng F, Gong X, Long M and Sun X (2017). A selective encryption scheme for protecting H.264/AVC video in multimedia social network, Multimedia Tools and Applications, 76:3, (3235-3253), Online publication date: 1-Feb-2017.
- Alon B and Omri E Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (307-335)
- Zhang Y, Mao Y and Zhong S (2016). Joint Differentially Private Gale–Shapley Mechanisms for Location Privacy Protection in Mobile Traffic Offloading Systems, IEEE Journal on Selected Areas in Communications, 34:10, (2738-2749), Online publication date: 1-Oct-2016.
- Han F, Qin J and Hu J (2016). Secure searches in the cloud, Future Generation Computer Systems, 62:C, (66-75), Online publication date: 1-Sep-2016.
- Liu X, Lu R, Ma J, Chen L and Bao H (2016). Efficient and privacy-preserving skyline computation framework across domains, Future Generation Computer Systems, 62:C, (161-174), Online publication date: 1-Sep-2016.
- Debnath S and Dutta R Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter Proceedings of the 18th International Conference on Information Security - Volume 9290, (209-226)
- Ahmad M, Ho Kang B and Lee S ReSet Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, (1-6)
- De A, Diakonikolas I and Servedio R Learning from satisfying assignments Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (478-497)
- Torres W, Bhattacharjee N and Srinivasan B Effectiveness of Fully Homomorphic Encryption to Preserve the Privacy of Biometric Data Proceedings of the 16th International Conference on Information Integration and Web-based Applications & Services, (152-158)
- Zhao Y, Ye J and Henderson T Privacy-aware location privacy preference recommendations Proceedings of the 11th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, (120-129)
- Ashok V and Mukkamala R A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters Proceedings of the 28th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy XXVIII - Volume 8566, (382-389)
- Gelernter N and Herzberg A On the limits of provable anonymity Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society, (225-236)
- Kissner L and Song D Privacy-preserving set operations Proceedings of the 25th annual international conference on Advances in Cryptology, (241-257)
Recommendations
Identity-Based signcryption from identity-based cryptography
WISA'11: Proceedings of the 12th international conference on Information Security ApplicationsA signcryption scheme encrypts and signs data in a single operation which is more efficient than using an encryption scheme combined with a signature scheme. Identity-based cryptography (IBC) does not require users to pre-compute key pairs and obtain ...
A Provably Secure Proxy Signature Scheme in Certificateless Cryptography
A proxy signature scheme enables an original signer to delegate its signing capability to a proxy signer and then the proxy signer can sign a message on behalf of the original signer. Recently, in order to eliminate the use of certificates in certified ...
Nonmalleable Cryptography
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext ...