Author: Oded GoldreichPublisher:
ISBN:
Category :
Languages : en
Pages : 31
Book Description
Definitions and Properties of Zero-Knowledge Proof Systems
Author: Oded GoldreichAdvances in Cryptology - CRYPTO '87
Author: Carl PomerancePublisher: Springer
ISBN: 3540481842
Category : Computers
Languages : en
Pages : 458
Book Description
Zero-knowledge interactive proofsystems are a new technique which can be used as a cryptographic tool for designing provably secure protocols. Goldwasser, Micali, and Rackoff originally suggested this technique for controlling the knowledge released in an interactive proof of membership in a language, and for classification of languages [19]. In this approach, knowledge is defined in terms of complexity to convey knowledge if it gives a computational advantage to the receiver, theory, and a message is said for example by giving him the result of an intractable computation. The formal model of interacting machines is described in [19, 15, 171. A proof-system (for a language L) is an interactive protocol by which one user, the prover, attempts to convince another user, the verifier, that a given input x is in L. We assume that the verifier is a probabilistic machine which is limited to expected polynomial-time computation, while the prover is an unlimited probabilistic machine. (In cryptographic applications the prover has some trapdoor information, or knows the cleartext of a publicly known ciphertext) A correct proof-system must have the following properties: If XE L, the prover will convince the verifier to accept the pmf with very high probability. If XP L no prover, no matter what program it follows, is able to convince the verifier to accept the proof, except with vanishingly small probability.
Theory of Cryptography
Author: Mass.) Conference Theory of Cryptography 2004 (CambridgePublisher: Springer Science & Business Media
ISBN: 3540210008
Category : Business & Economics
Languages : en
Pages : 533
Book Description
This book constitutes the refereed proceedings of the first International Theory of Cryptography Conference, TCC 2004, held in Cambridge, MA, USA in February 2004. The 28 revised full papers presented were carefully reviewed and selected from 70 submissions. The papers constitute a unique account of original research results on theoretical and foundational topics in cryptography; they deal with the paradigms, approaches, and techniques used to conceptualize, define, and provide solutions to natural cryptographic problems.
Advances in Cryptology — CRYPTO ’92
Author: Ernest F. BrickellPublisher: Springer
ISBN: 3540480714
Category : Computers
Languages : en
Pages : 602
Book Description
Crypto'92 took place on August 16-20, 1992. It was the twelfth in the series of annual cryptology conferences held on the beautiful campus of the University of California, Santa Barbara. Once again, it was sponsored by the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy. The conference ran smoothly, due to the diligent efforts of the g- eral chair, Spyros Magliveras of the University of Nebraska. One of the measures of the success of this series of conferences is represented by the ever increasing number of papers submitted. This year, there were 135 submissions to the c- ference, which represents a new record. Following the practice of recent program comm- tees, the papers received anonymous review. The program committee accepted 38 papers for presentation. In addition, there were two invited presentations, one by Miles Smid on the Digital Signature Standard, and one by Mike Fellows on presenting the concepts of cryptology to elementary-age students. These proceedings contains these 40 papers plus 3 papers that were presented at the Rump Session. I would like to thank all of the authors of the submitted papers and all of the speakers who presented papers. I would like to express my sincere appreciation to the work of the program committee: Ivan Damgard (Aarhus University, Denmark), Odd Goldreich (Technion, Israel), Burt Kaliski (RSA Data Security, USA), Joe Kilian (NEC, USA).
Theory of Cryptography
Author: Salil P. VadhanPublisher: Springer Science & Business Media
ISBN: 3540709355
Category : Business & Economics
Languages : en
Pages : 606
Book Description
This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised full papers cover encryption, universally composable security, arguments and zero knowledge, notions of security, obfuscation, secret sharing and multiparty computation, signatures and watermarking, private approximation and black-box reductions, and key establishment.
Theory of Cryptography
Author: Joe KilianPublisher: Springer
ISBN: 3540305769
Category : Computers
Languages : en
Pages : 631
Book Description
TCC 2005, the 2nd Annual Theory of Cryptography Conference, was held in Cambridge,Massachusetts,onFebruary10–12,2005.Theconferencereceived84 submissions,ofwhichtheprogramcommitteeselected32forpresentation.These proceedings contain the revised versions of the submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. The conference program also included a panel discussion on the future of theoretical cryptography and its relationship to the real world (whatever that is). It also included the traditional “rump session,” featuring short, informal talks on late-breaking research news. Much as hatters of old faced mercury-induced neurological damage as an occupational hazard, computer scientists will on rare occasion be a?icted with egocentrism, probably due to prolonged CRT exposure. Thus, you must view withpityandnotcontemptmyunalloyedelationathavingmynameonthefront cover of this LNCS volume, and my deep-seated conviction that I fully deserve the fame and riches that will surely come of it. However, having in recent years switched over to an LCD monitor, I would like to acknowledge some of the many who contributed to this conference. First thanks are due to the many researchers from all over the world who submitted their work to this conference. Lacking shrimp and chocolate-covered strawberries, TCC has to work hard to be a good conference. As a community, I think we have.
Theory of Cryptography
Author: Daniele MicciancioPublisher: Springer Science & Business Media
ISBN: 3642117988
Category : Computers
Languages : en
Pages : 617
Book Description
TCC2010,the7thTheoryofCryptographyConference,washeldatETHZurich, Zurich, Switzerland, during February 9–11, 2010. TCC 2010 was sponsored by theInternationalAssociationofCryptologicResearch(IACR)andwasorganized in cooperation with the Information Security and Cryptography group at ETH Zurich.The GeneralChairsof the conferencewereMartin Hirt andUeli Maurer. The conference received 100 submissions, of which the Program Committee selected 33 for presentation at the conference. The Best Student Paper Award was given to Kai-Min Chung and Feng-Hao Liu for their paper “ParallelRepe- tion Theorems for Interactive Arguments.” These proceedings consist of revised versions of those 33 papers. The revisions were not reviewed, and the authors bearfull responsibility forthe contentsoftheir papers.Inadditionto the regular papers, the conference featured two invited talks: “Secure Computation and Its Diverse Applications,” given by Yuval Ishai and “Privacy-Enhancing Crypt- raphy: From Theory Into Practice,” given by Jan Camenisch. Abstracts of the invited talks are also included in this volume. As in previous years, TCC received a steady stream of high-quality s- missions. Consequently, the selection process was very rewarding, but also very challenging, as a number of good papers could not be accepted due to lack of space. I would like to thank the TCC Steering Committee, and its Chair Oded Goldreich, for entrusting me with the responsibility of selecting the conference program.Since its inception, TCChas been verysuccessfulin attracting someof the best work in theoretical cryptography every year and o?ering a compelling program to its audience. I am honored I had the opportunity to contribute to the continuation of the success of the conference.
On the Definitions and the Properties of Zero-knowledge Arguments
Author: Rosario GennaroTheory of Cryptography
Author: Ronald CramerPublisher: Springer Science & Business Media
ISBN: 3642289134
Category : Computers
Languages : en
Pages : 669
Book Description
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R & D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes proceedings (published in time for the respective conference) post-proceedings (consisting of thoroughly revised final full papers) research monographs (which may be based on outstanding PhD work, research projects, technical reports, etc.) More recently, several color-cover or sublines have been added featuring, beyond a collection of papers, various added-value components; these sublines include tutorials (textbook-like monographs or collections of lectures given at advanced courses) state-of-the art surveys (offering complete and mediated coverage hot topics (introducing emergent topics in the broader community) In parallel to the printed book, each new volume is published electronically in LNCS Online. Book jacket.
Concurrent Zero-Knowledge
Author: Alon RosenPublisher: Springer Science & Business Media
ISBN: 3540329390
Category : Computers
Languages : en
Pages : 191
Book Description
Protocols that remain zero-knowledge when many instances are executed concurrently are called concurrent zero-knowledge, and this book is devoted to their study. The book presents constructions of concurrent zero-knowledge protocols, along with proofs of security. It also shows why "traditional" proof techniques (i.e., black-box simulation) are not suitable for establishing the concurrent zero-knowledge property of "message-efficient" protocols.