{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:41:44Z","timestamp":1781077304982,"version":"3.54.1"},"reference-count":122,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,2,15]]},"abstract":"<jats:p>Revolutionary developments which took place in the 1980\u2019s have transformed cryptography from a semi-scientific discipline to a respectable field in theoretical Computer Science. In particular, concepts such as computational indistinguishability, pseudorandomness and zeroknowledge interactive proofs were introduced and classical notions as secure encryption and unforgeable signatures were placed on sound grounds. The resulting field of cryptography, reviewed in this survey, is strongly linked to complexity theory (in contrast to \u201cclassical\u201d cryptography which is strongly related to information theory).<\/jats:p>","DOI":"10.1561\/0400000001","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T13:38:23Z","timestamp":1113226703000},"page":"1-116","source":"Crossref","is-referenced-by-count":39,"title":["Foundations of Cryptography \u2013 A Primer"],"prefix":"10.1108","volume":"1","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[{"name":"Department of Computer Science, Weizmann Institute of Science , Rehovot,","place":["Israel"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2005,2,15]]},"reference":[{"issue":"169","key":"2026041408270885300_ref001","article-title":"National institute for standards and technology","volume":"56","author":"Digital Signature Standard","year":"1991","journal-title":"Federal Register"},{"key":"2026041408270885300_ref002","first-page":"439","article-title":"Perfect zero-knowledge languages can be recognized in two rounds","volume-title":"28th IEEE Symposium on Foundations of Computer Science","author":"Aiello","year":"1987"},{"key":"2026041408270885300_ref003","first-page":"194","article-title":"Rsa\/rabin functions: certain parts are as hard as the whole","volume-title":"SIAM Journal on Computing","author":"Alexi","year":"1988"},{"key":"2026041408270885300_ref004","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and intractability of approximation problems","volume":"17","author":"Arora","year":"1998","journal-title":"Journal of the ACM"},{"key":"2026041408270885300_ref005","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/273865.273901","article-title":"Probabilistic checkable proofs: a new characterization of np","volume":"45","author":"Arora","year":"1998","journal-title":"Journal of the ACM"},{"key":"2026041408270885300_ref006","first-page":"21","article-title":"Checking computations in polylogarithmic time","volume-title":"23rd ACM Symposium on the Theory of Computing","author":"Babai","year":"1991"},{"key":"2026041408270885300_ref007","first-page":"307","article-title":"BPP has subexponential time simulations unless exptime has publishable proofs","volume":"3","author":"Babai","year":"1993","journal-title":"Complexity Theory"},{"key":"2026041408270885300_ref008","first-page":"106","article-title":"How to go beyond the black-box simulation barrier","volume-title":"42nd IEEE Symposium on Foundations of Computer Science","author":"Barak","year":"2001"},{"key":"2026041408270885300_ref009","first-page":"345","article-title":"Constant-round coin-tossing with a man in the middle or realizing the shared random string model","volume-title":"43th IEEE Symposium on Foundations of Computer Science","author":"Barak","year":"2002"},{"key":"2026041408270885300_ref010","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/FOCS.2004.71","article-title":"Universally composable protocols with relaxed set-up assumptions","volume-title":"45th IEEE Symposium on Foundations of Computer Science","author":"Barak","year":"2004"},{"key":"2026041408270885300_ref011","first-page":"194","article-title":"17th ieee conference on computational complexity","volume-title":"Universal arguments and their applications","author":"Barak","year":"2002"},{"issue":"4","key":"2026041408270885300_ref012","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1137\/S0097539703427975","article-title":"Strict polynomial-time in simulation and extraction","volume":"33","author":"Barak","year":"2004","journal-title":"SIAM Journal on Computing"},{"key":"2026041408270885300_ref013","volume-title":"Foundations of secure interactive computing","author":"Beaver","year":"1991"},{"key":"2026041408270885300_ref014","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00196771","article-title":"Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority","volume":"4","author":"Beaver","year":"1991","journal-title":"Journal of Cryptology"},{"key":"2026041408270885300_ref015","first-page":"503","article-title":"The round complexity of secure protocols","volume-title":"22nd ACM Symposium on the Theory of Computing","author":"Beaver","year":"1990"},{"key":"2026041408270885300_ref016","volume-title":"Electronic commerce and electronic payments","author":"Bellare"},{"key":"2026041408270885300_ref017","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-68697-5_1","volume-title":"Keying hash functions for message authentication","author":"Bellare","year":"1996"},{"key":"2026041408270885300_ref018","first-page":"419","article-title":"A modular approach to the design and analysis of authentication and key-exchange protocols","volume-title":"30th ACM Symposium on the Theory of Computing","author":"Bellare","year":"1998"},{"key":"2026041408270885300_ref019","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055718","volume-title":"Relations among notions of security for public-key encryption schemes","author":"Bellare","year":"1998"},{"key":"2026041408270885300_ref020","volume-title":"On defining proofs of knowledge","author":"Bellare","year":"1992"},{"key":"2026041408270885300_ref021","first-page":"374","article-title":"Does parallel repetition lower the error in computationally sound protocols?","volume-title":"38th IEEE Symposium on Foundations of Computer Science","author":"Bellare","year":"1997"},{"key":"2026041408270885300_ref022","first-page":"62","article-title":"Random oracles are practical: a paradigm for designing efficient protocols","volume-title":"1st Conf. on Computer and Communications Security","author":"Bellare","year":"1993"},{"key":"2026041408270885300_ref023","doi-asserted-by":"crossref","DOI":"10.1145\/167088.167109","article-title":"Asynchronous secure computation","volume-title":"25th ACM Symposium on the Theory of Computing","author":"Ben-Or"},{"key":"2026041408270885300_ref024","volume-title":"Everything provable is probable in zero-knowledge","author":"Ben-Or","year":"1990"},{"key":"2026041408270885300_ref025","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","volume-title":"20th ACM Symposium on the Theory of Computing","author":"Ben-Or","year":"1988"},{"key":"2026041408270885300_ref026","first-page":"183","article-title":"Asynchronous secure computations with optimal resilience","volume-title":"13th ACM Symposium on Principles of Distributed Computing","author":"Ben-Or","year":"1994"},{"key":"2026041408270885300_ref027","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy amplification by public discussion","volume":"17","author":"Bennett","year":"1998","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"2026041408270885300_ref028","first-page":"133","article-title":"Coin flipping by phone","volume":"15","author":"Blum","year":"1982","journal-title":"IEEE Sprig COMPCOM"},{"key":"2026041408270885300_ref029","first-page":"103","article-title":"Non-interactive zero-knowledge proof systems","volume-title":"20th ACM Symposium on Principles of Distributed Computing","author":"Blum","year":"1988"},{"key":"2026041408270885300_ref030","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-39568-7_23","volume-title":"An efficient probabilistic public-key encryption scheme which hides all partial information","author":"Blum","year":"1985"},{"key":"2026041408270885300_ref031","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudo-random bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"2026041408270885300_ref032","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","article-title":"Minimum disclosure proofs of knowledge","volume":"37","author":"Brassard","year":"1988","journal-title":"Journal of Computer and System Science"},{"key":"2026041408270885300_ref033","first-page":"136","article-title":"Universally composable security: a new paradigm for cryptographic protocols","volume-title":"42nd IEEE Symposium on Foundations of Computer Science","author":"Canetti"},{"key":"2026041408270885300_ref034","volume-title":"Studies in secure multi-party computation and applications","author":"Canetti","year":"1995"},{"issue":"1","key":"2026041408270885300_ref035","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","article-title":"Security and composition of multi-party cryptographic protocols","volume":"13","author":"Canetti","year":"2000","journal-title":"Journal of Cryptology"},{"key":"2026041408270885300_ref036","first-page":"639","article-title":"Adaptively secure multiparty computation","volume-title":"28th ACM Symposium on the Theory of Computing","author":"Canetti","year":"1996"},{"key":"2026041408270885300_ref037","first-page":"209","article-title":"The random oracle methodology, revisited","volume-title":"30th ACM Symposium on the Theory of Computing","author":"Canetti","year":"1998"},{"key":"2026041408270885300_ref038","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48658-5_38","volume-title":"Maintaining security in the presence of transient faults","author":"Canetti","year":"1994"},{"key":"2026041408270885300_ref039","first-page":"494","article-title":"Black-box concurrent zeroknowledge requires \u2126(log n) rounds","volume-title":"33rd ACM Symposium on the Theory of Computing","author":"Canetti","year":"2002"},{"key":"2026041408270885300_ref040","first-page":"494","article-title":"Universally composable two-party and multi-party secure computation","volume-title":"34th ACM Symposium on the Theory of Computing","author":"Canetti","year":"2002"},{"key":"2026041408270885300_ref041","first-page":"260","article-title":"Multi-party unconditionally secure protocols","volume-title":"20th ACM Symposium on Principles of Distributed Computing","author":"Chaum","year":"1987"},{"key":"2026041408270885300_ref042","first-page":"11","article-title":"Verifiable secret sharing and achieving simultaneity in the presence of faults","volume-title":"20th ACM Symposium on the Theory of Computing","author":"Chor","year":"1988"},{"key":"2026041408270885300_ref043","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0404004","article-title":"A zero-one law for boolean privacy","volume":"4","author":"Chor","year":"1991","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"2026041408270885300_ref044","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/41840.41862","article-title":"Achieving independence in logarithmic number of rounds","volume-title":"6th ACM Symposium on Principles of Distributed Computing","author":"Chor","year":"1987"},{"key":"2026041408270885300_ref045","first-page":"364","article-title":"Limits on the security of coin flips when half the processors are faulty","volume-title":"18th ACM Symposium on the Theory of Computing","author":"Cleve","year":"1986"},{"key":"2026041408270885300_ref046","volume-title":"Col lision free hash functions and public key signature schemes","author":"Damg\u00e5rd","year":"1988"},{"key":"2026041408270885300_ref047","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Improved non-committing encryption schemes based on general complexity assumption","author":"Damgard","year":"2000"},{"key":"2026041408270885300_ref048","first-page":"644","article-title":"New directions in cryptography","volume-title":"IEEE Trans. on Info. Theory","author":"Diffie","year":"1976"},{"issue":"2","key":"2026041408270885300_ref049","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/S0097539795291562","article-title":"Non-malleable cryptography","volume":"30","author":"Dolev","year":"2000","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"2026041408270885300_ref050","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","article-title":"Perfectly secure message transmission","volume":"40","author":"Dolev","year":"1993","journal-title":"Journal of the ACM"},{"key":"2026041408270885300_ref051","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated algorithms for byzantine agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM Journal on Computing"},{"key":"2026041408270885300_ref052","first-page":"409","article-title":"Concurrent zero-knowledge","volume-title":"30th ACM Symposium on the Theory of Computing","author":"Dwork","year":"1998"},{"issue":"6","key":"2026041408270885300_ref053","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","article-title":"A randomized protocol for signing contracts","volume":"28","author":"Even","year":"1985","journal-title":"Communications of the ACM"},{"key":"2026041408270885300_ref054","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/226643.226652","article-title":"Approximating clique is almost np-complete","volume":"43","author":"Feige","year":"1996","journal-title":"Journal of the ACM"},{"issue":"1","key":"2026041408270885300_ref055","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539792230010","article-title":"Multiple non-interactive zero-knowledge proofs under general assumptions","volume":"29","author":"Feige","year":"1999","journal-title":"SIAM Journal on Computing"},{"key":"2026041408270885300_ref056","first-page":"416","article-title":"Witness indistinguishability and witness hiding protocols","volume-title":"22nd ACM Symposium on the Theory of Computing","author":"Feige","year":"1990"},{"key":"2026041408270885300_ref057","volume-title":"How to prove yourself: practical solution to identification and signature problems","author":"Fiat","year":"1987"},{"key":"2026041408270885300_ref058","first-page":"204","article-title":"The complexity of perfect zero-knowledge","volume-title":"19th ACM Symposium on the Theory of Computing","author":"Fortnow","year":"1987"},{"issue":"3","key":"2026041408270885300_ref059","volume":"2","author":"Gemmell","year":"1997","journal-title":"An introduction to threshold cryptography"},{"key":"2026041408270885300_ref060","first-page":"101","article-title":"Simplified vss and fast-track multiparty computations with applications to threshold cryptography","volume-title":"17th ACM Symposium on Principles of Distributed Computing","author":"Gennaro","year":"1998"},{"key":"2026041408270885300_ref061","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Vol. 17 of Algorithms and Combinatorics series","author":"Goldreich","year":"1998"},{"key":"2026041408270885300_ref062","volume-title":"Secure multi-party computation","author":"Goldreich","year":"1998"},{"issue":"1","key":"2026041408270885300_ref063","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02620230","article-title":"A uniform complexity treatment of encryption and zeroknowledge","volume":"6","author":"Goldreich","year":"1998","journal-title":"Journal of Cryptology"},{"key":"2026041408270885300_ref064","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography \u2013 Basic Tools","author":"Goldreich","year":"2001"},{"key":"2026041408270885300_ref065","first-page":"332","article-title":"Concurrent zero-knowledge with timing, revisited","volume-title":"34th ACM Symposium on the Theory of Computing","author":"Goldreich","year":"2002"},{"key":"2026041408270885300_ref066","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography \u2013 Basic Applications","author":"Goldreich","year":"2004"},{"issue":"4","key":"2026041408270885300_ref067","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","article-title":"How to construct random functions","volume":"33","author":"Goldreich","year":"1986","journal-title":"Journal of the ACM"},{"issue":"4","key":"2026041408270885300_ref068","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0190(98)00116-1","article-title":"On the complexity of interactive proofs with bounded communication","volume":"67","author":"Goldreich","year":"1998","journal-title":"IPL"},{"issue":"2","key":"2026041408270885300_ref069","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00208001","article-title":"How to construct constant-round zero-knowledge proof systems for np","volume":"9","author":"Goldreich","year":"1996","journal-title":"Journal of Cryptology"},{"issue":"1","key":"2026041408270885300_ref070","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1137\/S0097539791220688","article-title":"On the composition of zero-knowledge proof systems","volume":"25","author":"Goldreich","year":"1996","journal-title":"SIAM Journal on Computing"},{"key":"2026041408270885300_ref071","first-page":"25","article-title":"Hard-core predicates for any one-way function","volume-title":"21st ACM Symposium on the Theory of Computing","author":"Goldreich","year":"1989"},{"key":"2026041408270885300_ref072","volume-title":"Fair computation of general functions in presence of immoral majority","author":"Goldreich","year":"1991"},{"key":"2026041408270885300_ref073","first-page":"218","article-title":"How to play any mental game \u2013 a completeness theorem for protocols with honest majority","volume-title":"19th ACM Symposium on the Theory of Computing","author":"Goldreich","year":"1987"},{"issue":"1","key":"2026041408270885300_ref074","first-page":"691","article-title":"Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems","volume":"38","author":"Goldreich","year":"1991","journal-title":"Journal of the ACM"},{"issue":"1","key":"2026041408270885300_ref075","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","article-title":"Definitions and properties of zero-knowledge proof systems","volume":"7","author":"Goldreich","year":"1994","journal-title":"Journal of Cryptology"},{"key":"2026041408270885300_ref076","first-page":"399","article-title":"Honest-verifier statistical zeroknowledge equals general statistical zero-knowledge","volume-title":"30th ACM Symposium on the Theory of Computing","author":"Goldreich","year":"1998"},{"key":"2026041408270885300_ref077","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00037-002-0169-0","article-title":"On interactive proofs with a laconic provers","volume":"11","author":"Goldreich","year":"2002","journal-title":"Computational Complexity"},{"key":"2026041408270885300_ref078","volume-title":"How to solve any protocol problem \u2013 an efficiency improvement","author":"Goldreich","year":"1988"},{"issue":"2","key":"2026041408270885300_ref079","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"Journal of Computer and System Science"},{"key":"2026041408270885300_ref080","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"2026041408270885300_ref081","first-page":"281","article-title":"A digital signature scheme secure against adaptive chosen-message attacks","volume-title":"SIAM Journal on Computing","author":"Goldwasser","year":"1988"},{"key":"2026041408270885300_ref082","volume-title":"Shift Register Sequences","author":"Golomb","year":"1982"},{"key":"2026041408270885300_ref083","unstructured":"R.\n              Greenstadt\n            \n          , \u201cElectronic voting bibliography,\u201d 2000. http:\/\/theory.lcs.mit.edu\/cis\/voting\/greenstadt-voting-bibligraphy.html."},{"issue":"4","key":"2026041408270885300_ref084","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","article-title":"A pseudorandom generator from any one-way function","volume":"28","author":"H\u00e5stad","year":"1999","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"2026041408270885300_ref085","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s001459910003","article-title":"Complete characterization of adversaries tolerable in secure multi-party computation","volume":"13","author":"Hirt","year":"2000","journal-title":"Journal of Cryptology"},{"key":"2026041408270885300_ref086","first-page":"12","article-title":"Pseudorandom generation from oneway functions","volume-title":"21st ACM Symposium on the Theory of Computing","author":"Impagliazzo","year":"1989"},{"key":"2026041408270885300_ref087","volume-title":"Direct zero-knowledge computations","author":"Impagliazzo","year":"1987"},{"key":"2026041408270885300_ref088","first-page":"245","article-title":"Complete characterization of security notions for probabilistic private-key encryption","volume-title":"32nd ACM Symposium on the Theory of Computing","author":"Katz","year":"2000"},{"key":"2026041408270885300_ref089","first-page":"723","article-title":"A note on efficient zero-knowledge proofs and arguments","volume-title":"24th ACM Symposium on the Theory of Computing","author":"Kilian","year":"1992"},{"key":"2026041408270885300_ref090","first-page":"560","article-title":"Concurrent and resettable zero-knowledge in poly-logarithmic rounds","volume-title":"33rd ACM Symposium on the Theory of Computing","author":"Kilian","year":"2001"},{"key":"2026041408270885300_ref091","volume-title":"The Art of Computer Programming","author":"Knuth","year":"1969"},{"key":"2026041408270885300_ref092","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48658-5_15","volume-title":"LFSR-based hashing and authentication","author":"Krawczyk","year":"1994"},{"key":"2026041408270885300_ref093","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Parallel coin-tossing and constant-round secure two-party computation","author":"Lindell","year":"2001"},{"key":"2026041408270885300_ref094","first-page":"514","article-title":"On the composition of authenticated byzantine agreement","volume-title":"34th ACM Symposium on the Theory of Computing","author":"Lindell","year":"2002"},{"issue":"4","key":"2026041408270885300_ref095","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/146585.146605","article-title":"Algebraic methods for interactive proof systems","volume":"39","author":"Lund","year":"1992","journal-title":"Journal of the ACM"},{"key":"2026041408270885300_ref096","volume-title":"Handbook of Applied Cryptography","author":"Menezes","year":"1996"},{"key":"2026041408270885300_ref097","doi-asserted-by":"crossref","DOI":"10.1109\/SP.1980.10006","article-title":"Protocols for public key cryptosystems","volume-title":"Proc. of the 1980 Symposium on Security and Privacy","author":"Merkle","year":"1980"},{"issue":"4","key":"2026041408270885300_ref098","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/S0097539795284959","article-title":"Computationally sound proofs","volume":"30","author":"Micali","year":"2000","journal-title":"SIAM Journal on Computing"},{"key":"2026041408270885300_ref099","volume-title":"Secure computation","author":"Micali","year":"1991"},{"key":"2026041408270885300_ref100","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","article-title":"Bit commitment using pseudorandom generators","volume":"4","author":"Naor","year":"1991","journal-title":"Journal of Cryptology"},{"key":"2026041408270885300_ref101","first-page":"590","article-title":"Communication preserving protocols for secure function evaluation","volume-title":"33rd ACM Symposium on the Theory of Computing","author":"Naor","year":"2001"},{"key":"2026041408270885300_ref102","first-page":"33","article-title":"Universal one-way hash functions and their cryptographic application","volume-title":"21st ACM Symposium on the Theory of Computing","author":"Naor","year":"1989"},{"key":"2026041408270885300_ref103","first-page":"427","article-title":"Public-key cryptosystems provably secure against chosen ciphertext attacks","volume-title":"22nd ACM Symposium on the Theory of Computing","author":"Naor","year":"1990"},{"key":"2026041408270885300_ref104","first-page":"3","volume-title":"2nd Israel Symp. on Theory of Computing and Systems","author":"Ostrovsky","year":"1993"},{"key":"2026041408270885300_ref105","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/112600.112605","article-title":"how to withstand mobile virus attacks","volume-title":"10th ACM Symposium on Principles of Distributed Computing","author":"Ostrovsky","year":"1991"},{"key":"2026041408270885300_ref106","first-page":"366","article-title":"Concurrent zero-knowledge proofs in logarithmic number of rounds","volume-title":"43rd IEEE Symposium on Foundations of Computer Science","author":"Prabhakaran","year":"2002"},{"key":"2026041408270885300_ref107","volume-title":"Foundations of Secure Computation","author":"Rabin","year":"1977"},{"key":"2026041408270885300_ref108","volume-title":"Digitalized signatures and public key functions as intractable as factoring","author":"Rabin","year":"1979"},{"key":"2026041408270885300_ref109","first-page":"73","article-title":"Verifiable secret sharing and multi-party protocols with honest majority","volume-title":"21st ACM Symposium on the Theory of Computing","author":"Rabin","year":"1989"},{"key":"2026041408270885300_ref110","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48910-X_29","volume-title":"On the concurrent composition of zero-knowledge proofs","author":"Richardson","year":"1999"},{"key":"2026041408270885300_ref111","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Communications of the ACM"},{"key":"2026041408270885300_ref112","first-page":"387","article-title":"One-way functions are necessary and sufficient for secure signatures","volume-title":"22nd ACM Symposium on the Theory of Computing","author":"Rompel","year":"1990"},{"issue":"2","key":"2026041408270885300_ref113","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/636865.636868","article-title":"A complete promise problem for statistical zeroknowledge","volume":"50","author":"Sahai","year":"2003","journal-title":"Journal of the ACM"},{"key":"2026041408270885300_ref114","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Robust non-interactive zero-knowledge","author":"Santis","year":"2001"},{"key":"2026041408270885300_ref115","first-page":"612","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Journal of the ACM"},{"issue":"4","key":"2026041408270885300_ref116","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1145\/146585.146609","article-title":"Ip =pspace","volume":"39","author":"Shamir","year":"1992","journal-title":"Journal of the ACM"},{"key":"2026041408270885300_ref117","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1983","journal-title":"Bell System Technical Journal"},{"key":"2026041408270885300_ref118","first-page":"330","article-title":"A complexity theoretic approach to randomness","volume-title":"15th ACM Symposium on the Theory of Computing","author":"Sipser","year":"1983"},{"key":"2026041408270885300_ref119","volume-title":"A Study of Statistical Zero-Knowledge Proofs","author":"Vadhan","year":"1999"},{"key":"2026041408270885300_ref120","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/FOCS.2004.13","article-title":"An unconditional study of computational zero knowledge","volume-title":"45th IEEE Symposium on Foundations of Computer Science","author":"Vadhan","year":"2004"},{"key":"2026041408270885300_ref121","first-page":"80","article-title":"Theory and application of trapdoor functions","volume-title":"23rd IEEE Symposium on Foundations of Computer Science","author":"Yao","year":"1982"},{"key":"2026041408270885300_ref122","first-page":"162","article-title":"How to generate and exchange secrets","volume-title":"27th IEEE Symposium on Foundations of Computer Science","author":"Yao","year":"1986"}],"container-title":["Foundations and Trends\u00ae in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/fttcs\/article-pdf\/1\/1\/1\/11515181\/0400000001en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/fttcs\/article-pdf\/1\/1\/1\/11515181\/0400000001en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:01:15Z","timestamp":1777489275000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/fttcs\/article\/1\/1\/1\/1359599\/Foundations-of-Cryptography-A-Primer"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,15]]},"references-count":122,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2,15]]}},"URL":"https:\/\/doi.org\/10.1561\/0400000001","relation":{},"ISSN":["1551-305X","1551-3068"],"issn-type":[{"value":"1551-305X","type":"print"},{"value":"1551-3068","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2,15]]}}}