TY - BOOK ID - 211998 TI - Concurrent zero-knowledge AU - Rosen, Alon. AU - Goldreich, Oded. PY - 2006 SN - 1280902663 9786610902668 3540329390 3540329382 3642069495 PB - Berlin ; New York : Springer, DB - UniCat KW - Zero-knowledge proofs. KW - Data encryption (Computer science) KW - Cryptography. KW - Computer science. KW - Computer programming. KW - Data structures (Computer science). KW - Computers. KW - Computer Science. KW - Programming Techniques. KW - Data Structures, Cryptology and Information Theory. KW - Theory of Computation. KW - Automatic computers KW - Automatic data processors KW - Computer hardware KW - Computing machines (Computers) KW - Electronic brains KW - Electronic calculating-machines KW - Electronic computers KW - Hardware, Computer KW - Computer systems KW - Cybernetics KW - Machine theory KW - Calculators KW - Cyberspace KW - Information structures (Computer science) KW - Structures, Data (Computer science) KW - Structures, Information (Computer science) KW - Electronic data processing KW - File organization (Computer science) KW - Abstract data types (Computer science) KW - Computers KW - Electronic computer programming KW - Electronic digital computers KW - Programming (Electronic computers) KW - Coding theory KW - Informatics KW - Science KW - Programming KW - Cryptanalysis KW - Cryptology KW - Secret writing KW - Steganography KW - Signs and symbols KW - Symbolism KW - Writing KW - Ciphers KW - Data encoding (Computer science) KW - Encryption of data (Computer science) KW - Computer security KW - Cryptography KW - Proofs, Zero-knowledge KW - Protocols, Zero-knowledge KW - Zero-knowledge protocols KW - Data structures (Computer scienc. KW - Information theory. KW - Data Structures and Information Theory. KW - Data structures (Computer science) KW - Communication theory KW - Communication UR - https://www.unicat.be/uniCat?func=search&query=sysid:211998 AB - Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a predetermined protocol. In addition to their direct applicability in cr- tography, zero-knowledge proofs serve as a good benchmark for the study of variousproblemsregardingcryptographicprotocols(e.g.,“securecomposition of protocols”). A fundamental question regarding zero-knowledge protocols refers to the preservation of security (i.e., of the zero-knowledge feature) when many - stances are executed concurrently, and in particular under a purely as- chronous model. The practical importance of this question, in the days of extensive Internet communication, seems clear. It turned out that this qu- tion is also very interesting from a theoretical point of view. In particular, this question served as a benchmark for the study of the security of concurrent executions of protocols and led to the development of techniques for coping with the problems that arise in that setting. ER -