Author: Eleanor BirrellPublisher:
ISBN:
Category :
Languages : en
Pages : 170
Book Description
Composition of Zero-knowledge Proofs
Author: Eleanor BirrellOn the Composition of Zero-knowledge Proof Systems
Author: DIMACS (GROUP)Publisher:
ISBN:
Category : Proof theory
Languages : en
Pages : 33
Book Description
Whether these parallel versions constitute zero-knowledge proofs was an intriguing open question arising from the early works on zero- knowledge. Other consequences are a proof of optimality for the round complexity of various known zero-knowledge protocols, and the necessity of using secret coins in the design of 'parallelizable' constant-round zero- knowledge proofs."
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.
On the Composition of Zero-knowledge Proof Systems
Author: Oded GoldreichAdvances in Cryptology - CRYPTO '89
Author: Gilles BrassardPublisher: Springer
ISBN: 0387348050
Category : Computers
Languages : en
Pages : 628
Book Description
CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation.
Automata, Languages, and Programming
Author: Michael S. PatersonPublisher: Springer
ISBN:
Category : Computers
Languages : en
Pages : 796
Book Description
Papers from the 17th International Colloquium held in England, July 1990. They cover all important areas of theoretical computer science, such as: computability, formal languages, computational complexity, data types and structures, term rewriting systems, robotics. No index. Annotation copyrighted by Book News, Inc., Portland, OR
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).
Machine Learning Techniques and Analytics for Cloud Security
Author: Rajdeep ChakrabortyPublisher: John Wiley & Sons
ISBN: 1119764092
Category : Computers
Languages : en
Pages : 484
Book Description
MACHINE LEARNING TECHNIQUES AND ANALYTICS FOR CLOUD SECURITY This book covers new methods, surveys, case studies, and policy with almost all machine learning techniques and analytics for cloud security solutions The aim of Machine Learning Techniques and Analytics for Cloud Security is to integrate machine learning approaches to meet various analytical issues in cloud security. Cloud security with ML has long-standing challenges that require methodological and theoretical handling. The conventional cryptography approach is less applied in resource-constrained devices. To solve these issues, the machine learning approach may be effectively used in providing security to the vast growing cloud environment. Machine learning algorithms can also be used to meet various cloud security issues, such as effective intrusion detection systems, zero-knowledge authentication systems, measures for passive attacks, protocols design, privacy system designs, applications, and many more. The book also contains case studies/projects outlining how to implement various security features using machine learning algorithms and analytics on existing cloud-based products in public, private and hybrid cloud respectively. Audience Research scholars and industry engineers in computer sciences, electrical and electronics engineering, machine learning, computer security, information technology, and cryptography.
Efficient Secure Two-Party Protocols
Author: Carmit HazayPublisher: Springer Science & Business Media
ISBN: 3642143032
Category : Computers
Languages : en
Pages : 263
Book Description
In the setting of multiparty computation, sets of two or more parties with p- vate inputs wish to jointly compute some (predetermined) function of their inputs. The computation should be such that the outputs received by the parties are correctly distributed, and furthermore, that the privacy of each party’s input is preserved as much as possible, even in the presence of - versarial behavior. This encompasses any distributed computing task and includes computations as simple as coin-tossing and broadcast, and as c- plex as electronic voting, electronic auctions, electronic cash schemes and anonymous transactions. The feasibility (and infeasibility) of multiparty c- putation has been extensively studied, resulting in a rather comprehensive understanding of what can and cannot be securely computed, and under what assumptions. The theory of cryptography in general, and secure multiparty computation in particular, is rich and elegant. Indeed, the mere fact that it is possible to actually achieve the aforementioned task is both surprising and intriguing.
Advances 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.