Skip header Section
Skip Bibliometrics Section
Foundations of Cryptography: Basic ToolsJanuary 2000
- Author:
- Oded Goldreich
Skip Abstract Section
Abstract
From the Publisher:
This book presents a rigorous and systematic treatment of the foundational issues of cryptography: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. Rather than describing ad__ __hoc approaches, this book emphasizes the clarification of fundamental concepts and the demonstration of the feasibility of solving cryptographic problems.
Cited By
Samanthula B and Patel H Privacy-Preserving and Outsourced Computation Framework for Power Usage Control in Smart Grids Proceedings of the 2023 ACM Workshop on Secure and Trustworthy Cyber-Physical Systems, (1-7)- 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)
- 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)
- 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)
- Desai N, Lal Das M, Chaudhari P and Kumar N (2022). Background knowledge attacks in privacy-preserving data publishing models, Computers and Security, 122:C, Online publication date: 1-Nov-2022.
- Bowers A, Du J, Lin D and Jiang W Easy-to-Implement Two-Server based Anonymous Communication with Simulation Security Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, (831-842)
- Breuer M, Meyer U and Wetzel S Privacy-Preserving Maximum Matching on General Graphs and its Application to Enable Privacy-Preserving Kidney Exchange Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy, (53-64)
- Hashemi H, Wang Y and Annavaram M DarKnight: An Accelerated Framework for Privacy and Integrity Preserving Deep Learning Using Trusted Hardware MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture, (212-224)
- Pass R and Venkitasubramaniam M (2021). Guest Column, ACM SIGACT News, 52:1, (47-69), Online publication date: 16-Mar-2021.
- Boemer F, Cammarota R, Demmler D, Schneider T and Yalame H MP2ML Proceedings of the 15th International Conference on Availability, Reliability and Security, (1-10)
- Garg S, Goldwasser S and Vasudevan P Formalizing Data Deletion in the Context of the Right to Be Forgotten Advances in Cryptology – EUROCRYPT 2020, (373-402)
- Aranha D, Orlandi C, Takahashi A and Zaverucha G Security of Hedged Fiat–Shamir Signatures Under Fault Attacks Advances in Cryptology – EUROCRYPT 2020, (644-674)
- Liang M and Yang L (2020). Block encryption of quantum messages, Quantum Information Processing, 19:4, Online publication date: 15-Feb-2020.
- Hazay C and Venkitasubramaniam M (2019). On the Power of Secure Two-Party Computation, Journal of Cryptology, 33:1, (271-318), Online publication date: 1-Jan-2020.
- Ananth P, Deshpande A, Kalai Y and Lysyanskaya A Fully Homomorphic NIZK and NIWI Proofs Theory of Cryptography, (356-385)
- Sturm C, Scalanczi J, Schönig S and Jablonski S (2019). A Blockchain-based and resource-aware process execution engine, Future Generation Computer Systems, 100:C, (19-34), Online publication date: 1-Nov-2019.
- Naor M and Eylon Y (2019). Bloom Filters in Adversarial Environments, ACM Transactions on Algorithms, 15:3, (1-30), Online publication date: 31-Jul-2019.
- Shao J, Ji S and Yang T Privacy-aware Document Ranking with Neural Signals Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, (305-314)
- Hazay C and Venkitasubramaniam M (2019). On Black-Box Complexity of Universally Composable Security in the CRS Model, Journal of Cryptology, 32:3, (635-689), Online publication date: 1-Jul-2019.
- Zhandry M (2019). The Magic of ELFs, Journal of Cryptology, 32:3, (825-866), Online publication date: 1-Jul-2019.
- Agrawal S Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation Advances in Cryptology – EUROCRYPT 2019, (191-225)
- Ramos L and Silva J Privacy and Data Protection Concerns Regarding the Use of Blockchains in Smart Cities Proceedings of the 12th International Conference on Theory and Practice of Electronic Governance, (342-347)
- Unruh D (2018). Everlasting Multi-party Computation, Journal of Cryptology, 31:4, (965-1011), Online publication date: 1-Oct-2018.
- Teslya N and Ryabchikov I Blockchain Platforms Overview for Industrial IoT Purposes Proceedings of the 22st Conference of Open Innovations Association FRUCT, (250-256)
- 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.
- Férée H, Hym S, Mayero M, Moyen J and Nowak D Formal proof of polynomial-time complexity with quasi-interpretations Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (146-157)
- Applebaum B, Ishai Y and Kushilevitz E (2018). Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings, Journal of Cryptology, 31:1, (1-22), Online publication date: 1-Jan-2018.
- Teslya N and Ryabchikov I Blockchain-Based Platform Architecture for Industrial IoT Proceedings of the 21st Conference of Open Innovations Association FRUCT, (321-329)
- Lindell Y and Rabin T Secure Two-Party Computation with Fairness - A Necessary Design Principle Theory of Cryptography, (565-580)
- Bitansky N, Canetti R, Chiesa A, Goldwasser S, Lin H, Rubinstein A and Tromer E (2017). The Hunting of the SNARK, Journal of Cryptology, 30:4, (989-1066), Online publication date: 1-Oct-2017.
- Applebaum B and Moses Y (2017). Locally Computable UOWHF with Linear Shrinkage, Journal of Cryptology, 30:3, (672-698), Online publication date: 1-Jul-2017.
- Castro A (2017). Quantum one-way permutation over the finite field of two elements, Quantum Information Processing, 16:6, (1-18), Online publication date: 1-Jun-2017.
- Dani V, King V, Movahedi M, Saia J and Zamani M (2017). Secure multi-party computation in large networks, Distributed Computing, 30:3, (193-229), Online publication date: 1-Jun-2017.
- Applebaum B, Avron J and Brzuska C (2017). Arithmetic Cryptography, Journal of the ACM, 64:2, (1-74), Online publication date: 30-Apr-2017.
- Braun J, Buchmann J, Demirel D, Geihs M, Fujiwara M, Moriai S, Sasaki M and Waseda A LINCOS Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, (461-468)
- Corrigan-Gibbs H and Boneh D Prio Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation, (259-282)
- Morozov K, Roy P and Sakurai K On unconditionally binding code-based commitment schemes Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, (1-5)
- Hussain R, Son J, Kim D, Nogueira M, Oh H, Tokuta A, Seo J and Chang R (2017). PBF, Wireless Communications & Mobile Computing, 2017, Online publication date: 1-Jan-2017.
- Hazay C and Patra A (2017). Efficient One-Sided Adaptively Secure Computation, Journal of Cryptology, 30:1, (321-371), Online publication date: 1-Jan-2017.
- Zhao Y and Chow S Towards Proofs of Ownership Beyond Bounded Leakage Proceedings of the 10th International Conference on Provable Security - Volume 10005, (340-350)
- Dachman-Soled D Towards Non-Black-Box Separations of Public Key Encryption and One Way Function Proceedings, Part II, of the 14th International Conference on Theory of Cryptography - Volume 9986, (169-191)
- Baum C, Orsini E and Scholl P Efficient Secure Multiparty Computation with Identifiable Abort Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (461-490)
- Hemenway B, Lu S, Ostrovsky R and Welser Iv W High-Precision Secure Computation of Satellite Collision Probabilities Proceedings of the 10th International Conference on Security and Cryptography for Networks - Volume 9841, (169-187)
- Deng Y, Garay J, Ling S, Wang H and Yung M On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs Proceedings of the 10th International Conference on Security and Cryptography for Networks - Volume 9841, (237-253)
- Applebaum B and Raykov P On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816, (449-477)
- Ananth P, Jain A, Naor M, Sahai A and Yogev E Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption Proceedings, Part II, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9815, (491-520)
- Hirt M, Maurer U, Tschudi D and Zikas V Network-Hiding Communication and Applications to Multi-party Protocols Proceedings, Part II, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9815, (335-365)
- Sivanandam S, Selvi Selvaraj S, Srinivasan A and Chandrasekaran P (2016). Stronger public key encryption system withstanding RAM scraper like attacks, Security and Communication Networks, 9:12, (1650-1662), Online publication date: 1-Aug-2016.
- Bootle J, Cerulli A, Chaidos P and Groth J Efficient Zero-Knowledge Proof Systems Tutorial Lectures on Foundations of Security Analysis and Design VIII - Volume 9808, (1-31)
- Wang T and Zhao Y Secure Dynamic SSE via Access Indistinguishable Storage Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, (535-546)
- Kiayias A, Zhou H and Zikas V Fair and Robust Multi-party Computation Using a Global Transaction Ledger Proceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9666, (705-734)
- Gennaro R, Hazay C and Sorensen J (2016). Automata Evaluation and Text Search Protocols with Simulation-Based Security, Journal of Cryptology, 29:2, (243-282), Online publication date: 1-Apr-2016.
- Chenette N, Lewi K, Weis S and Wu D Practical Order-Revealing Encryption with Limited Leakage Revised Selected Papers of the 23rd International Conference on Fast Software Encryption - Volume 9783, (474-493)
- Lan C, Sherry J, Popa R, Ratnasamy S and Liu Z Embark Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation, (255-273)
- Ishai Y, Kushilevitz E, Lu S and Ostrovsky R Private Large-Scale Databases with Distributed Searchable Symmetric Encryption Proceedings of the RSA Conference on Topics in Cryptology - CT-RSA 2016 - Volume 9610, (90-107)
- (2016). Pseudorandom generators against advised context-free languages, Theoretical Computer Science, 613:C, (1-27), Online publication date: 1-Feb-2016.
- Bitansky N, Goldwasser S, Jain A, Paneth O, Vaikuntanathan V and Waters B Time-Lock Puzzles from Randomized Encodings Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, (345-356)
- Wikström D Simplified Universal Composability Framework Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562, (566-595)
- Yao A, Yung M and Zhao Y (2016). Concurrent Knowledge Extraction in Public-Key Models, Journal of Cryptology, 29:1, (156-219), Online publication date: 1-Jan-2016.
- Miles E and Viola E (2015). Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs, Journal of the ACM, 62:6, (1-29), Online publication date: 10-Dec-2015.
- Kampanakis P and Yavuz A (2015). BAFi, Security and Communication Networks, 8:17, (3180-3190), Online publication date: 25-Nov-2015.
- Pass R and shelat a Micropayments for Decentralized Currencies Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (207-218)
- Hanser C, Rabkin M and Schröder D Verifiably Encrypted Signatures: Security Revisited and a New Construction Computer Security -- ESORICS 2015, (146-164)
- Goldreich O and Meir O (2015). Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly, ACM Transactions on Computation Theory, 7:4, (1-13), Online publication date: 11-Sep-2015.
- Goldwasser S, Kalai Y and Rothblum G (2015). Delegating Computation, Journal of the ACM, 62:4, (1-64), Online publication date: 11-Sep-2015.
- Chen F, Mohammed N, Wang S, He W, Cheng S and Jiang X Cloud-assisted distributed private data sharing Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, (202-211)
- Huang G and Li H On Zero Knowledge Argument with PQT Soundness Revised Selected Papers of the 16th International Workshop on Information Security Applications - Volume 9503, (326-335)
- Harn L, Lin C and Li Y (2015). Fair secret reconstruction in (t, n) secret sharing, Journal of Information Security and Applications, 23:C, (1-7), Online publication date: 1-Aug-2015.
- Miles E and Viola E (2015). On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist), Journal of Cryptology, 28:3, (509-532), Online publication date: 1-Jul-2015.
- Deng Y and Zhang Y (2015). Program equivalence in linear contexts, Theoretical Computer Science, 585:C, (71-90), Online publication date: 20-Jun-2015.
- Nowak D and Zhang Y (2015). Formal security proofs with minimal fuss, Information and Computation, 241:C, (96-113), Online publication date: 1-Apr-2015.
- Tadaki K and Doi N (2015). Cryptography and Algorithmic Randomness, Theory of Computing Systems, 56:3, (544-580), Online publication date: 1-Apr-2015.
- Lin H and Pass R (2015). Constant-Round Nonmalleable Commitments from Any One-Way Function, Journal of the ACM, 62:1, (1-30), Online publication date: 2-Mar-2015.
- Yu Y, Li X and Weng J (2015). Pseudorandom generators from regular one-way functions, Theoretical Computer Science, 569:C, (58-69), Online publication date: 2-Mar-2015.
- Haitner I, Hoch J, Reingold O and Segev G (2015). Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, SIAM Journal on Computing, 44:1, (193-242), Online publication date: 5-Feb-2015.
- Papadopoulos S, Cormode G, Deligiannakis A and Garofalakis M (2014). Lightweight Query Authentication on Streams, ACM Transactions on Database Systems, 39:4, (1-45), Online publication date: 30-Dec-2015.
- Ioannou L and Mosca M (2014). Public-key cryptography based on bounded quantum reference frames, Theoretical Computer Science, 560:P1, (33-45), Online publication date: 4-Dec-2014.
- Xue H, Li B, Lu X, Wang K and Liu Y On the Lossiness of 2k-th Power and the Instantiability of Rabin-OAEP Proceedings of the 13th International Conference on Cryptology and Network Security - Volume 8813, (34-49)
- Sahai A and Waters B How to use indistinguishability obfuscation Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (475-484)
- Kaaniche N, Moustaine E and Laurent M A novel zero-knowledge scheme for proof of data possession in cloud storage applications Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, (522-531)
- Seurin Y On the Lossiness of the Rabin Trapdoor Function Proceedings of the 17th International Conference on Public-Key Cryptography --- PKC 2014 - Volume 8383, (380-398)
- Halpern J, Pass R and Seeman L The truth behind the myth of the folk theorem Proceedings of the 5th conference on Innovations in theoretical computer science, (543-554)
- Sobhdel Y and Jalili R A UC-Secure Authenticated Contributory Group Key Exchange Protocol Based on Discrete Logarithm Proceedings of the 9th International Conference on Information Systems Security - Volume 8303, (390-401)
- Macario-Rat G, Plut J and Gilbert H New Insight into the Isomorphism of Polynomial Problem IP1S and Its Use in Cryptography Part I of the Proceedings of the 19th International Conference on Advances in Cryptology - ASIACRYPT 2013 - Volume 8269, (117-133)
- Baldimtsi F and Lysyanskaya A Anonymous credentials light Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, (1087-1098)
- Williams P and Sion R (2013). Access privacy and correctness on untrusted storage, ACM Transactions on Information and System Security, 16:3, (1-29), Online publication date: 1-Nov-2013.
- Khamsemanan N and Skeith W Translation-Randomizable Distributions via Random Walks Proceedings of the 7th International Conference on Provable Security - Volume 8209, (249-270)
- Guo S, Zhong S and Zhang A A Privacy Preserving Markov Model for Sequence Classification Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, (561-568)
- Denysyuk O and Rodrigues L Byzantine renaming in synchronous systems with t < N Proceedings of the 2013 ACM symposium on Principles of distributed computing, (210-219)
- Halpern J From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (2-3)
- Mu B and Bakiras S Private proximity detection for convex polygons Proceedings of the 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess, (36-43)
- Papadopoulos S, Cormode G, Deligiannakis A and Garofalakis M Lightweight authentication of linear algebraic queries on data streams Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, (881-892)
- Chung K, Pass R and Seth K Non-black-box simulation from one-way functions and applications to resettable security Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, (231-240)
- Hu R, Morozov K and Takagi T Proof of plaintext knowledge for code-based public-key encryption revisited Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, (535-540)
- Hermans J, Peeters R and Onete C Efficient, secure, private distance bounding without key updates Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks, (207-218)
- Chung K and Pass R (2013). Guest column, ACM SIGACT News, 44:1, (50-69), Online publication date: 6-Mar-2013.
- Döttling N, Mie T, Müller-Quade J and Nilges T Implementing resettable UC-Functionalities with untrusted tamper-proof hardware-tokens Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (642-661)
- Lu S and Ostrovsky R Distributed oblivious RAM for secure two-party computation Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (377-396)
- Krenn S, Pietrzak K and Wadia A A counterexample to the chain rule for conditional HILL entropy Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (23-39)
- Gradwohl R, Livne N and Rosen A (2013). Sequential rationality in cryptographic protocols, ACM Transactions on Economics and Computation, 1:1, (1-38), Online publication date: 25-Jan-2013.
- Goldreich O, Goldwasser S and Ron D On the possibilities and limitations of pseudodeterministic algorithms Proceedings of the 4th conference on Innovations in Theoretical Computer Science, (127-138)
- Pass R, Lin H and Venkitasubramaniam M A unified framework for UC from only OT Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (699-717)
- Kakvi S, Kiltz E and May A Certifying RSA Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (404-414)
- 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.
- Gordon S, Katz J, Kolesnikov V, Krell F, Malkin T, Raykova M and Vahlis Y Secure two-party computation in sublinear (amortized) time Proceedings of the 2012 ACM conference on Computer and communications security, (513-524)
- Nachef V, Patarin J and Volte E Zero-Knowledge for multivariate polynomials Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America, (194-213)
- Baron J, El Defrawy K, Minkovich K, Ostrovsky R and Tressler E 5PM Proceedings of the 8th international conference on Security and Cryptography for Networks, (222-240)
- Popa R, Redfield C, Zeldovich N and Balakrishnan H (2012). CryptDB, Communications of the ACM, 55:9, (103-111), Online publication date: 1-Sep-2012.
- Yavuz A and Ning P (2012). Self-sustaining, efficient and forward-secure cryptographic constructions for Unattended Wireless Sensor Networks, Ad Hoc Networks, 10:7, (1204-1220), Online publication date: 1-Sep-2012.
- Miles E and Viola E Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417, (68-85)
- Zhou X, Ding X and Chen K A generic construction of accountable decryption and its applications Proceedings of the 17th Australasian conference on Information Security and Privacy, (322-335)
- Morozov K and Takagi T Zero-knowledge protocols for the mceliece encryption Proceedings of the 17th Australasian conference on Information Security and Privacy, (180-193)
- Hermans J and Peeters R Private yoking proofs Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues, (96-108)
- Gilad Y and Herzberg A (2012). LOT, ACM Transactions on Information and System Security, 15:2, (1-30), Online publication date: 1-Jul-2012.
- Applebaum B Pseudorandom generators with long stretch and low locality from random local one-way functions Proceedings of the forty-fourth annual ACM symposium on Theory of computing, (805-816)
- Garg S, Goyal V, Jain A and Sahai A Concurrently secure computation in constant rounds Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques, (99-116)
- Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S and Yang K (2012). On the (im)possibility of obfuscating programs, Journal of the ACM, 59:2, (1-48), Online publication date: 1-Apr-2012.
- Ng W, Wen Y and Zhu H Private data deduplication protocols in cloud storage Proceedings of the 27th Annual ACM Symposium on Applied Computing, (441-446)
- Chung K, Pass R and Tseng W The knowledge tightness of parallel zero-knowledge Proceedings of the 9th international conference on Theory of Cryptography, (512-529)
- Dodis Y, Jain A, Moran T and Wichs D Counterexamples to hardness amplification beyond negligible Proceedings of the 9th international conference on Theory of Cryptography, (476-493)
- Berman I and Haitner I From non-adaptive to adaptive pseudorandom functions Proceedings of the 9th international conference on Theory of Cryptography, (357-368)
- Trevisan L (2012). Pseudorandomness and derandomization, XRDS: Crossroads, The ACM Magazine for Students, 18:3, (27-31), Online publication date: 1-Mar-2012.
- Yan J Complete problem for perfect zero-knowledge quantum proof Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (419-430)
- Fefferman B, Shaltiel R, Umans C and Viola E On beating the hybrid argument Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, (468-483)
- Rührmair U SIMPL systems as a keyless cryptographic and security primitive Cryptography and Security, (329-354)
- Alaggan M, Gambs S and Kermarrec A Private similarity computation in distributed systems Proceedings of the 15th international conference on Principles of Distributed Systems, (357-377)
- Gorantla M, Boyd C, Nieto J and Manulis M (2008). Modeling key compromise impersonation attacks on group key exchange protocols, ACM Transactions on Information and System Security, 14:4, (1-24), Online publication date: 1-Dec-2011.
- El Aimani L Generic constructions for verifiable signcryption Proceedings of the 14th international conference on Information Security and Cryptology, (204-218)
- Ioannou L and Mosca M A new spin on quantum cryptography Proceedings of the 4th international conference on Post-Quantum Cryptography, (255-274)
- Chen J, Emura K and Miyaji A Non-interactive opening for ciphertexts encrypted by shared keys Proceedings of the 13th international conference on Information and communications security, (57-68)
- Popa R, Redfield C, Zeldovich N and Balakrishnan H CryptDB Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, (85-100)
- Dutta R Access polynomial based self-healing key distribution with improved security and performance Proceedings of the First international conference on Security aspects in information technology, (72-82)
- Gjøsteen K, Petrides G and Steine A A novel framework for protocol analysis Proceedings of the 5th international conference on Provable security, (340-347)
- Baumslag G, Fazio N, Nicolosi A, Shpilrain V and Skeith W Generalized learning problems and applications to non-commutative cryptography Proceedings of the 5th international conference on Provable security, (324-339)
- Tanaka K, Yamada A and Yasunaga K Weak oblivious transfer from strong one-way functions Proceedings of the 5th international conference on Provable security, (34-51)
- Ding N and Gu D Precise time and space simulatable zero-knowledge Proceedings of the 5th international conference on Provable security, (16-33)
- Hermoni O, Gilboa N, Felstaine E, Elovici Y and Dolev S Rendezvous tunnel for anonymous publishing Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (223-237)
- Yamakami T (2011). Immunity and pseudorandomness of context-free languages, Theoretical Computer Science, 412:45, (6432-6450), Online publication date: 1-Oct-2011.
- Al-Hamdani W Elliptic curve for data protection Proceedings of the 2011 Information Security Curriculum Development Conference, (1-14)
- Williams P, Sion R and Sotakova M (2011). Practical Oblivious Outsourced Storage, ACM Transactions on Information and System Security, 14:2, (1-28), Online publication date: 1-Sep-2011.
- Cho K and Lee D Biometric based secure communications without pre-deployed key for biosensor implanted in body sensor networks Proceedings of the 12th international conference on Information Security Applications, (203-218)
- Sakumoto K, Shirai T and Hiwatari H Public-key identification schemes based on multivariate quadratic polynomials Proceedings of the 31st annual conference on Advances in cryptology, (706-723)
- Bajaj S and Sion R (2020). Trust edDB, Proceedings of the VLDB Endowment, 4:12, (1359-1362), Online publication date: 1-Aug-2011.
- Loebenberger D and Nüsken M Analyzing standards for RSA integers Proceedings of the 4th international conference on Progress in cryptology in Africa, (260-277)
- Bajaj S and Sion R TrustedDB Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, (205-216)
- Lin H and Pass R Constant-round non-malleable commitments from any one-way function Proceedings of the forty-third annual ACM symposium on Theory of computing, (705-714)
- Pass R Limits of provable security from standard assumptions Proceedings of the forty-third annual ACM symposium on Theory of computing, (109-118)
- Ioannou L and Mosca M Unconditionally-Secure and Reusable Public-Key Authentication Revised Selected Papers of the 6th Conference on Theory of Quantum Computation, Communication, and Cryptography - Volume 6745, (121-142)
- Applebaum B Key-dependent message security Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology, (527-546)
- Dahl M, Delaune S and Steel G Formal analysis of privacy for anonymous location based services Proceedings of the 2011 international conference on Theory of Security and Applications, (98-112)
- Miles E and Viola E On the complexity of non-adaptively increasing the stretch of pseudorandom generators Proceedings of the 8th conference on Theory of cryptography, (522-539)
- Lin H and Pass R Concurrent non-malleable zero knowledge with adaptive inputs Proceedings of the 8th conference on Theory of cryptography, (274-292)
- González Muñiz M and Laud P On the (im)possibility of perennial message recognition protocols without public-key cryptography Proceedings of the 2011 ACM Symposium on Applied Computing, (1510-1515)
- Bilogrevic I, Jadliwala M, Hubaux J, Aad I and Niemi V Privacy-preserving activity scheduling on mobile devices Proceedings of the first ACM conference on Data and application security and privacy, (261-272)
- Chen K, Kavuluru R and Guo S RASP Proceedings of the first ACM conference on Data and application security and privacy, (249-260)
- Zheng Q and Xu S Fair and dynamic proofs of retrievability Proceedings of the first ACM conference on Data and application security and privacy, (237-248)
- Chan A and Castelluccia C (2011). A security framework for privacy-preserving data aggregation in wireless sensor networks, ACM Transactions on Sensor Networks, 7:4, (1-45), Online publication date: 1-Feb-2011.
- Nakamura T, Inenaga S, Baba K, Ikeda D and Yasuura H An anonymous authentication protocol with single-database PIR Proceedings of the Ninth Australasian Information Security Conference - Volume 116, (3-8)
- Lee C, Lu C and Tsai S (2010). Deterministic extractors for independent-symbol sources, IEEE Transactions on Information Theory, 56:12, (6501-6512), Online publication date: 1-Dec-2010.
- Emura K, Hanaoka G and Sakai Y Group signature implies PKE with non-interactive opening and threshold PKE Proceedings of the 5th international conference on Advances in information and computer security, (181-198)
- Jiang S Dwork-Naor ZAP and its application in deniable authentication, revisited Proceedings of the 6th international conference on Information security and cryptology, (443-454)
- Nowak D and Zhang Y A calculus for game-based security proofs Proceedings of the 4th international conference on Provable security, (35-52)
- Anada H and Arita S Identification schemes of proofs of ability secure against concurrent man-in-the-middle attacks Proceedings of the 4th international conference on Provable security, (18-34)
- Deng R, Li Y, Yung M and Zhao Y A new framework for RFID privacy Proceedings of the 15th European conference on Research in computer security, (1-18)
- Carbunar B and Sion R Joining privately on outsourced data Proceedings of the 7th VLDB conference on Secure data management, (70-86)
- Jing W, Xu H and Li B A new efficient construction for non-malleable zero-knowledge sets Proceedings of the 11th international conference on Information security applications, (31-43)
- Maji H, Prabhakaran M and Rosulek M A zero-one law for cryptographic complexity with respect to computational UC security Proceedings of the 30th annual conference on Advances in cryptology, (595-612)
- Lin H, Pass R, Tseng W and Venkitasubramaniam M Concurrent non-malleable zero knowledge proofs Proceedings of the 30th annual conference on Advances in cryptology, (429-446)
- Yang B, Nakagawa H, Sato I and Sakuma J Collusion-resistant privacy-preserving data mining Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, (483-492)
- Lucas C, Raub D and Maurer U Hybrid-secure MPC Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (219-228)
- Backes M, Lorenz S, Maffei M and Pecina K Anonymous webs of trust Proceedings of the 10th international conference on Privacy enhancing technologies, (130-148)
- Chow S, Ma C and Weng J Zero-knowledge argument for simultaneous discrete logarithms Proceedings of the 16th annual international conference on Computing and combinatorics, (520-529)
- Yao A, Yung M and Zhao Y Concurrent knowledge extraction in the public-key model Proceedings of the 37th international colloquium conference on Automata, languages and programming, (702-714)
- Nishimaki R, Fujisaki E and Tanaka K A multi-trapdoor commitment scheme from the RSA assumption Proceedings of the 15th Australasian conference on Information security and privacy, (182-199)
- Gao J, Sion R and Lederer S (2010). Collaborative location certification for sensor networks, ACM Transactions on Sensor Networks, 6:4, (1-26), Online publication date: 1-Jul-2010.
- Carbunar B and Sion R Regulatory compliant oblivious RAM Proceedings of the 8th international conference on Applied cryptography and network security, (456-474)
- Boiten E and Grundy D The logic of large enough Proceedings of the 10th international conference on Mathematics of program construction, (42-57)
- Yang B and Nakagawa H Computation of ratios of secure summations in multi-party privacy-preserving latent dirichlet allocation Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I, (189-197)
- Stütz T and Uhl A Efficient format-compliant encryption of regular languages Proceedings of the 11th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security, (81-92)
- Micciancio D Computational soundness, co-induction, and encryption cycles Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (362-380)
- Halpern J and Pass R I don't want to think about it now Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, (182-190)
- Galindo D, Libert B, Fischlin M, Fuchsbauer G, Lehmann A, Manulis M and Schröder D Public-key encryption with non-interactive opening Proceedings of the Third international conference on Cryptology in Africa, (333-350)
- Atallah M and Frikken K Securely outsourcing linear algebra computations Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, (48-59)
- Nakamura T, Inenaga S, Ikeda D, Baba K and Yasuura H An identifiable yet unlinkable authentication system with smart cards for multiple services Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV, (236-251)
- Dolev S, Gilboa N and Kopeetsky M Computing multi-party trust privately Proceedings of the 2010 ACM Symposium on Applied Computing, (1460-1465)
- Yang G, Tan C, Huang Q and Wong D Probabilistic public key encryption with equality test Proceedings of the 2010 international conference on Topics in Cryptology, (119-131)
- Pass R and Venkitasubramaniam M Private coins versus public coins in zero-knowledge proof systems Proceedings of the 7th international conference on Theory of Cryptography, (588-605)
- Birrell E and Vadhan S Composition of zero-knowledge proofs with efficient provers Proceedings of the 7th international conference on Theory of Cryptography, (572-587)
- Bangerter E, Camenisch J and Krenn S Efficiency limitations for Σ-protocols for group homomorphisms Proceedings of the 7th international conference on Theory of Cryptography, (553-571)
- Ostrovsky R, Pandey O and Visconti I Efficiency preserving transformations for concurrent non-malleable zero knowledge Proceedings of the 7th international conference on Theory of Cryptography, (535-552)
- Pass R, Tseng W and Venkitasubramaniam M Eye for an eye Proceedings of the 7th international conference on Theory of Cryptography, (518-534)
- Schoenmakers B Voting schemes Algorithms and theory of computation handbook, (15-15)
- Frikken K Secure multiparty computation Algorithms and theory of computation handbook, (14-14)
- Desmedt Y Encryption schemes Algorithms and theory of computation handbook, (10-10)
- Stefan D Hardware framework for the rabbit stream cipher Proceedings of the 5th international conference on Information security and cryptology, (230-247)
- Damgård I and Lunemann C Quantum-Secure Coin-Flipping and Applications Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (52-69)
- Wee H Zero Knowledge in the Random Oracle Model, Revisited Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (417-434)
- Bowers K, Juels A and Oprea A Proofs of retrievability Proceedings of the 2009 ACM workshop on Cloud computing security, (43-54)
- Chen Y, Sion R and Carbunar B XPay Proceedings of the 8th ACM workshop on Privacy in the electronic society, (41-50)
- Ma C, Li Y, Deng R and Li T RFID privacy Proceedings of the 16th ACM conference on Computer and communications security, (54-65)
- Xu Y, Wang K, Yang G and Fu A Online anonymity for personalized web services Proceedings of the 18th ACM conference on Information and knowledge management, (1497-1500)
- Dutta R, Mukhopadhyay S and Dowling T Generalized self-healing key distribution in wireless adhoc networks with trade-offs in user's pre-arranged life cycle and collusion resistance Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks, (80-87)
- Chen T and Zhong S (2009). Privacy-preserving backpropagation neural network learning, IEEE Transactions on Neural Networks, 20:10, (1554-1564), Online publication date: 1-Oct-2009.
- Kurosawa K and Takagi T (2009). One-wayness equivalent to general factoring, IEEE Transactions on Information Theory, 55:9, (4249-4262), Online publication date: 1-Sep-2009.
- Zhong S (2009). Identity-based mix, Computers and Electrical Engineering, 35:5, (705-711), Online publication date: 1-Sep-2009.
- Deepthi P, Sathidevi P and Lakshmi V (2009). A new hardware efficient stream cipher based on hash functions, International Journal of Communication Networks and Distributed Systems, 3:4, (340-361), Online publication date: 1-Aug-2009.
- Candido S and Hutchinson S Detecting intrusion faults in remotely controlled systems Proceedings of the 2009 conference on American Control Conference, (4968-4973)
- Lin H and Pass R Non-malleability amplification Proceedings of the forty-first annual ACM symposium on Theory of computing, (189-198)
- Lin H, Pass R and Venkitasubramaniam M A unified framework for concurrent security Proceedings of the forty-first annual ACM symposium on Theory of computing, (179-188)
- Zhang Z, Cao Z and Ma R An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, (470-479)
- Deepthi P and Sathidevi P (2009). Design, implementation and analysis of hardware efficient stream ciphers using LFSR based hash functions, Computers and Security, 28:3-4, (229-241), Online publication date: 1-May-2009.
- Galindo D Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology, (389-398)
- Franklin M, Gondree M and Mohassel P Communication-Efficient Private Protocols for Longest Common Subsequence Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology, (265-278)
- Bellare M, Hofheinz D and Yilek S Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening Proceedings of the 28th Annual International Conference on Advances in Cryptology - EUROCRYPT 2009 - Volume 5479, (1-35)
- Huang G, Lin D and Zhang Y Efficient Concurrent npoly(logn)-Simulatable Argument of Knowledge Proceedings of the 5th International Conference on Information Security Practice and Experience, (93-101)
- Hoogh S, Schoenmakers B, Škorić B and Villegas J Verifiable Rotation of Homomorphic Encryptions Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09, (393-410)
- Hasan R, Sion R and Winslett M The case of the fake Picasso Proccedings of the 7th conference on File and storage technologies, (1-14)
- Law Y, Palaniswami M, Hoesel L, Doumen J, Hartel P and Havinga P (2009). Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols, ACM Transactions on Sensor Networks, 5:1, (1-38), Online publication date: 1-Feb-2009.
- Kawachi A, Tanaka K and Xagawa K Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (372-389)
- Backes M and Unruh D Limits of Constructive Security Proofs Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (290-307)
- Nojima R, Imai H, Kobara K and Morozov K (2008). Semantic security for the McEliece cryptosystem without random oracles, Designs, Codes and Cryptography, 49:1-3, (289-305), Online publication date: 1-Dec-2008.
- Hazay C and Lindell Y Constructions of truly practical secure protocols using standardsmartcards Proceedings of the 15th ACM conference on Computer and communications security, (491-500)
- Backes M, Hritcu C and Maffei M Type-checking zero-knowledge Proceedings of the 15th ACM conference on Computer and communications security, (357-370)
- Williams P, Sion R and Carbunar B Building castles out of mud Proceedings of the 15th ACM conference on Computer and communications security, (139-148)
- Bogdanov A, Mossel E and Vadhan S The Complexity of Distinguishing Markov Random Fields Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, (331-342)
- Pandey O, Pass R and Vaikuntanathan V Adaptive One-Way Functions and Applications Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology, (57-74)
- Kundu A and Bertino E (2008). Structural signatures for tree data structures, Proceedings of the VLDB Endowment, 1:1, (138-150), Online publication date: 1-Aug-2008.
- Signorini A, Gulli A and Segre A Distributed marketplaces using P2P networks and public-key cryptography Proceedings of the 3rd international conference on Scalable information systems, (1-7)
- Shaltiel R and Viola E Hardness amplification proofs require majority Proceedings of the fortieth annual ACM symposium on Theory of computing, (589-598)
- Ishai Y, Kushilevitz E, Ostrovsky R and Sahai A Cryptography with constant computational overhead Proceedings of the fortieth annual ACM symposium on Theory of computing, (433-442)
- Gopalan P, Klivans A and Zuckerman D List-decoding reed-muller codes over small fields Proceedings of the fortieth annual ACM symposium on Theory of computing, (265-274)
- Hayashi S and Tada M (2008). A Digital Signature Scheme Based on NP-Complete Lattice Problems, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:5, (1253-1264), Online publication date: 1-May-2008.
- Chandran N, Goyal V and Sahai A New constructions for UC secure computation using tamper-proof hardware Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (545-562)
- Pandey O, Pass R, Sahai A, Tseng W and Venkitasubramaniam M Precise concurrent zero knowledge Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (397-414)
- Cash D, Kiltz E and Shoup V The twin Diffie-Hellman problem and applications Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (127-145)
- Garcia F and van Rossum P (2008). Sound and complete computational interpretation of symbolic hashes in the standard model, Theoretical Computer Science, 394:1-2, (112-133), Online publication date: 20-Mar-2008.
- Yin Y, Li X and Hu Y (2008). Fast S-box security mechanism research based on the polymorphic cipher, Information Sciences: an International Journal, 178:6, (1603-1610), Online publication date: 20-Mar-2008.
- Dedić N, Harnik D and Reyzin L Saving private randomness in one-way functions and pseudorandom generators Proceedings of the 5th conference on Theory of cryptography, (607-625)
- Lin H, Pass R and Venkitasubramaniam M Concurrent non-malleable commitments from any one-way function Proceedings of the 5th conference on Theory of cryptography, (571-588)
- Haitner I, Hoch J and Segev G A linear lower bound on the communication complexity of single-server private information retrieval Proceedings of the 5th conference on Theory of cryptography, (445-464)
- Haitner I Semi-honest to malicious oblivious transfer Proceedings of the 5th conference on Theory of cryptography, (412-426)
- Hazay C and Lindell Y Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries Proceedings of the 5th conference on Theory of cryptography, (155-175)
- Biham E, Goren Y and Ishai Y Basing weak public-key cryptography on strong one-way functions Proceedings of the 5th conference on Theory of cryptography, (55-72)
- Petit C, Standaert F, Pereira O, Malkin T and Yung M A block cipher based pseudo random number generator secure against side-channel key recovery Proceedings of the 2008 ACM symposium on Information, computer and communications security, (56-65)
- Hayashi M, Kawachi A and Kobayashi H (2008). Quantum measurements for hidden subgroup problems with optimal sample complexity, Quantum Information & Computation, 8:3, (345-358), Online publication date: 1-Mar-2008.
- Laud P (2008). On the computational soundness of cryptographically masked flows, ACM SIGPLAN Notices, 43:1, (337-348), Online publication date: 14-Jan-2008.
- Laud P On the computational soundness of cryptographically masked flows Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (337-348)
- Teranishi I, Oyama T and Ogata W (2008). General Conversion for Obtaining Strongly Existentially Unforgeable Signatures, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:1, (94-106), Online publication date: 1-Jan-2008.
- Vadhan S The complexity of zero knowledge Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science, (52-70)
- Goyal V, Moriarty R, Ostrovsky R and Sahai A Concurrent statistical zero-knowledge arguments for NP from one way functions Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security, (444-459)
- Franklin M, Gondree M and Mohassel P Multi-party indirect indexing and applications Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security, (283-297)
- Anckaert B, Madou M, De Sutter B, De Bus B, De Bosschere K and Preneel B Program obfuscation Proceedings of the 2007 ACM workshop on Quality of protection, (15-20)
- Chan A and Castelluccia C On the privacy of concealed data aggregation Proceedings of the 12th European conference on Research in Computer Security, (390-405)
- Evdokimov S and Günther O Encryption techniques for secure database outsourcing Proceedings of the 12th European conference on Research in Computer Security, (327-342)
- Sion R, Bajaj S, Carbunar B and Katzenbeisser S NS2 Proceedings of the 33rd international conference on Very large data bases, (1342-1345)
- Ge T and Zdonik S Answering aggregation queries in a secure system model Proceedings of the 33rd international conference on Very large data bases, (519-530)
- Luh W and Kundur D Distributed keyless security for correlated data with applications in visual sensor networks Proceedings of the 9th workshop on Multimedia & security, (75-86)
- Zhong S and Wu F On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks Proceedings of the 13th annual ACM international conference on Mobile computing and networking, (278-289)
- Brown D and Gjøsteen K A security analysis of the NIST SP 800-90 elliptic curve random number generator Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (466-481)
- Canetti R, Rivest R, Sudan M, Trevisan L, Vadhan S and Wee H Amplifying collision resistance Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (264-283)
- Horvitz O and Katz J Universally-composable two-party computation in two rounds Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (111-129)
- Applebaum B, Ishai Y and Kushilevitz E Cryptography with constant input locality Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (92-110)
- Wan L, Ng W, Han S and Lee V Privacy-preservation for gradient descent methods Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, (775-783)
- Kong J, Hong X and Gerla M (2007). An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks, IEEE Transactions on Mobile Computing, 6:8, (888-902), Online publication date: 1-Aug-2007.
- Bresson E and Manulis M Malicious participants in group key exchange Proceedings of the 4th international conference on Autonomic and Trusted Computing, (395-409)
- Kiayias A and Zhou H Trading static for adaptive security in universally composable zero-knowledge Proceedings of the 34th international conference on Automata, Languages and Programming, (316-327)
- Cautis B Distributed access control Proceedings of the 12th ACM symposium on Access control models and technologies, (61-70)
- Pass R and Venkitasubramaniam M An efficient parallel repetition theorem for Arthur-Merlin games Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (420-429)
- Ishai Y, Kushilevitz E, Ostrovsky R and Sahai A Zero-knowledge from secure multiparty computation Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (21-30)
- 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)
- Rothe J (2007). Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages, ACM SIGACT News, 38:2, (16-20), Online publication date: 1-Jun-2007.
- Yao A, Yao F and Zhao Y A note on the feasibility of generalized universal composability Proceedings of the 4th international conference on Theory and applications of models of computation, (474-485)
- Yao A, Yao F and Zhao Y A note on universal composable zero knowledge in common reference string model Proceedings of the 4th international conference on Theory and applications of models of computation, (462-473)
- Deng Y and Lin D Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability Proceedings of the 26th annual international conference on Advances in Cryptology, (148-168)
- Yung M and Zhao Y Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model Proceedings of the 26th annual international conference on Advances in Cryptology, (129-147)
- Lindell Y and Pinkas B An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries Proceedings of the 26th annual international conference on Advances in Cryptology, (52-78)
- Ong S and Vadhan S Zero Knowledge and Soundness Are Symmetric Proceedings of the 26th annual international conference on Advances in Cryptology, (187-209)
- McCarthy J, Krishnamurthi S, Guttman J and Ramsdell J Compiling cryptographic protocols for deployment on the web Proceedings of the 16th international conference on World Wide Web, (687-696)
- Elbaz A, Lee H, Servedio R and Wan A (2007). Separating Models of Learning from Correlated and Uncorrelated Data, The Journal of Machine Learning Research, 8, (277-290), Online publication date: 1-May-2007.
- Farashahi R, Schoenmakers B and Sidorenko A Efficient pseudorandom generators based on the DDH assumption Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (426-441)
- Berbain C and Gilbert H On the security of IV dependent stream ciphers Proceedings of the 14th international conference on Fast Software Encryption, (254-273)
- Van Le T, Burmester M and de Medeiros B Universally composable and forward-secure RFID authentication and authenticated key exchange Proceedings of the 2nd ACM symposium on Information, computer and communications security, (242-252)
- Hazay C, Katz J, Koo C and Lindell Y Concurrently-secure blind signatures without random oracles or setup assumptions Proceedings of the 4th conference on Theory of cryptography, (323-341)
- Goldreich O On expected probabilistic polynomial-time adversaries Proceedings of the 4th conference on Theory of cryptography, (174-193)
- Wee H Lower bounds for non-interactive zero-knowledge Proceedings of the 4th conference on Theory of cryptography, (103-117)
- Müller-Quade J and Unruh D Long-term security and universal composability Proceedings of the 4th conference on Theory of cryptography, (41-60)
- Lu C, Tsai S and Wu H (2007). Improved hardness amplification in NP, Theoretical Computer Science, 370:1-3, (293-298), Online publication date: 1-Feb-2007.
- Adelsbach A, Huber U and Sadeghi A Fingercasting-joint fingerprinting and decryption of broadcast messages Transactions on data hiding and multimedia security II, (1-34)
- Pavan A, Santhanam R and Vinodchandran N Some results on average-case hardness within the polynomial hierarchy Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science, (188-199)
- Curtmola R, Garay J, Kamara S and Ostrovsky R Searchable symmetric encryption Proceedings of the 13th ACM conference on Computer and communications security, (79-88)
- Hopper N and Vasserman E On the effectiveness of k;-anonymity against traffic analysis and surveillance Proceedings of the 5th ACM workshop on Privacy in electronic society, (9-18)
- Garcia F and van Rossum P Sound computational interpretation of symbolic hashes in the standard model Proceedings of the 1st international conference on Security, (33-47)
- Yang W, Huang L, Xiao M and Jing W Quantum ANDOS protocol with unconditional security Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II, (20-30)
- Canetti R, Cheung L, Kaynar D, Liskov M, Lynch N, Pereira O and Segala R Time-bounded task-PIOAs Proceedings of the 20th international conference on Distributed Computing, (238-253)
- Raiciu C, Handley M and Rosenblum D Exploit hijacking Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense, (123-130)
- Esponda F, Ackley E, Helman P, Jia H and Forrest S Protecting data privacy through hard-to-reverse negative databases Proceedings of the 9th international conference on Information Security, (72-84)
- Applebaum B, Ishai Y and Kushilevitz E On pseudorandom generators with linear stretch in NC
0 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, (260-271) - Brickell J and Shmatikov V Efficient anonymity-preserving data collection Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (76-85)
- Jakimoski G Some notes on the security of the timed efficient stream loss-tolerant authentication scheme Proceedings of the 13th international conference on Selected areas in cryptography, (342-357)
- Wei Y and Huang L Unconditionally secure all-or-nothing disclosure of secrets based on POVM measurements Proceedings of the 10th WSEAS international conference on Communications, (33-38)
- Kawachi A and Yamakami T Quantum hardcore functions by complexity-theoretical quantum list decoding Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (216-227)
- Jiang S Efficient primitives from exponentiation in Z Proceedings of the 11th Australasian conference on Information Security and Privacy, (259-270)
- Naor M and Rothblum G Learning to impersonate Proceedings of the 23rd international conference on Machine learning, (649-656)
- Berbain C, Gilbert H and Patarin J QUAD Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (109-128)
- Dubrov B and Ishai Y On the randomness complexity of efficient sampling Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (711-720)
- Akavia A, Goldreich O, Goldwasser S and Moshkovitz D On basing one-way functions on NP-hardness Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (701-710)
- Micali S and Pass R Local zero knowledge Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (306-315)
- Watrous J Zero-knowledge against quantum attacks Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (296-305)
- Nguyen M and Vadhan S Zero knowledge with efficient provers Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (287-295)
- Avidan S and Butman M Blind vision Proceedings of the 9th European conference on Computer Vision - Volume Part III, (1-13)
- Gennaro R and Lindell Y (2006). A framework for password-based authenticated key exchange1, ACM Transactions on Information and System Security, 9:2, (181-234), Online publication date: 1-May-2006.
- Catalano D, Dodis Y and Visconti I Mercurial commitments Proceedings of the Third conference on Theory of Cryptography, (120-144)
- Datta A, Derek A, Mitchell J, Ramanathan A and Scedrov A Games and the impossibility of realizable ideal functionality Proceedings of the Third conference on Theory of Cryptography, (360-379)
- Micciancio D, Ong S, Sahai A and Vadhan S Concurrent zero knowledge without complexity assumptions Proceedings of the Third conference on Theory of Cryptography, (1-20)
- Barak B, Lindell Y and Vadhan S (2006). Lower bounds for non-black-box zero knowledge, Journal of Computer and System Sciences, 72:2, (321-391), Online publication date: 1-Mar-2006.
- Tian X and Wong D Session corruption attack and improvements on encryption based MT-Authenticators Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology, (34-51)
- Danner N and Royer J (2006). Adventures in time and space, ACM SIGPLAN Notices, 41:1, (168-179), Online publication date: 12-Jan-2006.
- Danner N and Royer J Adventures in time and space Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (168-179)
- Adelsbach A, Rohe M and Sadeghi A Efficient implementation of zero-knowledge proofs for watermark detection in multimedia data Transactions on Data Hiding and Multimedia Security I, (73-103)
- Goldreich O On promise problems Theoretical Computer Science, (254-290)
- Goldreich O Concurrent zero-knowledge with timing, revisited Theoretical Computer Science, (27-87)
- Li H and Li B An unbounded simulation-sound non-interactive zero-knowledge proof system for NP Proceedings of the First SKLOIS conference on Information Security and Cryptology, (210-220)
- Wikström D A sender verifiable mix-net and a new proof of a shuffle Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security, (273-292)
- Kawachi A, Kobayashi H, Koshiba T and Putra R (2005). Universal test for quantum one-way permutations, Theoretical Computer Science, 345:2-3, (370-385), Online publication date: 22-Nov-2005.
- Laud P Secrecy types for a simulatable cryptographic library Proceedings of the 12th ACM conference on Computer and communications security, (26-35)
- Venkatachalam B Software watermarking as a proof of identity Proceedings of the 4th international conference on Digital Watermarking, (299-312)
- Jha S, Kruger L and McDaniel P Privacy preserving clustering Proceedings of the 10th European conference on Research in Computer Security, (397-417)
- Elyada Y and Horn D Can dynamic neural filters produce pseudo-random sequences? Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I, (211-216)
- Zhong S, Li L, Liu Y and Yang Y On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks Proceedings of the 11th annual international conference on Mobile computing and networking, (117-131)
- Yang Z, Zhong S and Wright R Anonymity-preserving data collection Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, (334-343)
- Brandt F and Sandholm T Decentralized voting with unconditional privacy Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (357-364)
- Brandt F and Sandholm T On correctness and privacy in distributed mechanisms Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms, (212-225)
- Hevia A and Micciancio D Simultaneous broadcast revisited Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, (324-333)
- Di Crescenzo G and Kiayias A Asynchronous perfectly secure communication over one-time pads Proceedings of the 32nd international conference on Automata, Languages and Programming, (216-227)
- Wee H On round-efficient argument systems Proceedings of the 32nd international conference on Automata, Languages and Programming, (140-152)
- Horvitz O and Katz J Bounds on the efficiency of “black-box” commitment schemes Proceedings of the 32nd international conference on Automata, Languages and Programming, (128-139)
- Bradford P and Gavrylyako O (2005). Foundations of Security for Hash Chains in Ad Hoc Networks, Cluster Computing, 8:2-3, (189-195), Online publication date: 1-Jul-2005.
- Elbaz A, Lee H, Servedio R and Wan A Separating models of learning from correlated and uncorrelated data Proceedings of the 18th annual conference on Learning Theory, (637-651)
- Chang Y and Mitzenmacher M Privacy preserving keyword searches on remote encrypted data Proceedings of the Third international conference on Applied Cryptography and Network Security, (442-455)
- Itkis G, McNerney R and Russell S Intrusion-Resilient secure channels Proceedings of the Third international conference on Applied Cryptography and Network Security, (238-253)
- Kalai Y, Lindell Y and Prabhakaran M Concurrent general composition of secure protocols in the timing model Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (644-653)
- Pass R and Rosen A New and improved constructions of non-malleable cryptographic protocols Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (533-542)
- Wee H On obfuscating point functions Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (523-532)
- Harnik D, Kilian J, Naor M, Reingold O and Rosen A On robust combiners for oblivious transfer and other primitives Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (96-113)
- Haitner I, Horvitz O, Katz J, Koo C, Morselli R and Shaltiel R Reducing complexity assumptions for statistically-hiding commitment Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (58-77)
- Xue R, Song D, Zhang Z and Feng D A Generic Scheme for Zero-Knowledge Sets Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005, (249-263)
- Saxena A, Soh B and Zantidis D A digital cash protocol based on additive zero knowledge Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III, (672-680)
- Weis S Security Parallels between People and Pervasive Devices Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops, (105-109)
- Frikken K and Atallah M Achieving fairness in private contract negotiation Proceedings of the 9th international conference on Financial Cryptography and Data Security, (270-284)
- Lin H, Trevisan L and Wee H On hardness amplification of one-way functions Proceedings of the Second international conference on Theory of Cryptography, (34-49)
- Goldwasser S and Kharchenko D Proof of plaintext knowledge for the ajtai-dwork cryptosystem Proceedings of the Second international conference on Theory of Cryptography, (529-555)
- Canetti R, Halevi S and Steiner M Hardness amplification of weakly verifiable puzzles Proceedings of the Second international conference on Theory of Cryptography, (17-33)
- Freedman M, Ishai Y, Pinkas B and Reingold O Keyword search and oblivious pseudorandom functions Proceedings of the Second international conference on Theory of Cryptography, (303-324)
- Zhang D, Liu M and Yang Z A method for authenticating based on ZK in distributed environment Proceedings of the Second international conference on Parallel and Distributed Processing and Applications, (730-734)
- Pucella R (2004). Specifying confidentiality, ACM SIGACT News, 35:4, (72-83), Online publication date: 1-Dec-2004.
- Zhao X, Dai Y and Feng D A generalized method for constructing and proving zero-knowledge watermark proof systems Proceedings of the Third international conference on Digital Watermarking, (204-217)
- Reiter M and Wang X Fragile mixing Proceedings of the 11th ACM conference on Computer and communications security, (227-235)
- Adelsbach A, Rohe M and Sadeghi A Overcoming the obstacles of zero-knowledge watermark detection Proceedings of the 2004 workshop on Multimedia and security, (46-55)
- Brandt F and Sandholm T (Im)Possibility of Unconditionally Privacy-Preserving Auctions Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2, (810-817)
- Harnik D, Naor M, Reingold O and Rosen A Completeness in two-party secure computation Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, (252-261)
- Chevallier-Mames B, Ciet M and Joye M (2004). Low-Cost Solutions for Preventing Simple Side-Channel Analysis, IEEE Transactions on Computers, 53:6, (760-768), Online publication date: 1-Jun-2004.
- Micciancio D and Warinschi B (2004). Completeness theorems for the Abadi-Rogaway language of encrypted expressions, Journal of Computer Security, 12:1, (99-129), Online publication date: 1-Jan-2004.
- Tseng Y (2003). A scalable key-management scheme with minimizing key storage for secure group communications, International Journal of Network Management, 13:6, (419-425), Online publication date: 1-Nov-2003.
- Wu X, Wang Y and Zheng Y Privacy preserving database application testing Proceedings of the 2003 ACM workshop on Privacy in the electronic society, (118-128)
- Adelsbach A, Katzenbeisser S and Sadeghi A (2003). Watermark detection with zero-knowledge disclosure, Multimedia Systems, 9:3, (266-278), Online publication date: 1-Sep-2003.
- Goldreich O (2003). Cryptography and cryptographic protocols, Distributed Computing, 16:2-3, (177-199), Online publication date: 1-Sep-2003.
- Alkassar A, Stüble C and Sadeghi A Secure object identification Proceedings of the 2003 workshop on New security paradigms, (77-85)
- Gennaro R and Lindell Y A framework for password-based authenticated key exchange Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (524-543)
- Lindell Y A simpler construction of CCA2-secure public-key encryption under general assumptions Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (241-254)
- Katz J Efficient and non-malleable proofs of plaintext knowledge and applications Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (211-228)
- Hast G Nearly one-sided tests and the Goldreich-Levin predicate Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (195-210)
- Pass R Simulation in quasi-polynomial time, and its application to protocol composition Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (160-176)
- Micciancio D and Petrank E Simulatable commitments and efficient concurrent zero-knowledge Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (140-159)
- Zhao Y, Deng X, Lee C and Zhu H Resettable zero-knowledge in the weak public-key model Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (123-139)
- Pinkas B Fair secure two-party computation Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (87-105)
- Sahai A and Vadhan S (2003). A complete problem for statistical zero knowledge, Journal of the ACM, 50:2, (196-249), Online publication date: 1-Mar-2003.
- Cachin C Modeling complexity in secure distributed computing Future directions in distributed computing, (57-61)
- Deng X, Lee C, Zhao Y and Zhu H Reduction zero-knowledge Proceedings of the 3rd international conference on Security in communication networks, (303-317)
- Dedic N, Reyzin L and Vadhan S An improved pseudorandom generator based on hardness of factoring Proceedings of the 3rd international conference on Security in communication networks, (88-101)
- Bellare (2002). A Note on Negligible Functions, Journal of Cryptology, 15:4, (271-284), Online publication date: 1-Sep-2002.
- Barak B and Lindell Y Strict polynomial-time in simulation and extraction Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (484-493)
- Goldreich O Concurrent zero-knowledge with timing, revisited Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (332-340)
- Fischlin M (2001). Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions, Theoretical Computer Science, 268:2, (199-219), Online publication date: 17-Oct-2001.
- Katz J and Yung M Complete characterization of security notions for probabilistic private-key encryption Proceedings of the thirty-second annual ACM symposium on Theory of computing, (245-254)
- Blake-Wilson S (2000). Information Security, Mathematics, and Public-Key Cryptography, Designs, Codes and Cryptography, 19:2-3, (77-99), Online publication date: 1-Mar-2000.
- Naccache D and Stern J A new public key cryptosystem based on higher residues Proceedings of the 5th ACM conference on Computer and communications security, (59-66)
- Canetti R, Micciancio D and Reingold O Perfectly one-way probabilistic hash functions (preliminary version) Proceedings of the thirtieth annual ACM symposium on Theory of computing, (131-140)
- Okamoto T On relationships between statistical zero-knowledge proofs Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (649-658)
- Bellare M and Rogaway P Random oracles are practical Proceedings of the 1st ACM conference on Computer and communications security, (62-73)
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 ...