الصفحة 9
الصفحة 9
Advances in cryptology -- ASIACRYPT 2006 ; 12th International conference on the theory and application of cryptology and information security, Shanghai, China, December 3-7, 2006, Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, held in Shanghai, China, December 2006. The 30 revised full papers cover attacks on hash functions, stream ciphers, biometrics and ECC computation, id-based schemes, public-key schemes, RSA and factorization, construction of hash function, protocols, block ciphers, and signatures.
Advances in cryptology – ASIACRYPT 2005 ; 11th International conference on the theory and application of cryptology and information security, Chennai, India, December 4-8, 2005, Proceedings
This book constitutes the proceedings of the 11th International Conference on the Theory and Application of Cryptology and Information Security, This conference was organized by the InternationalAssociation for Cryptologic Research (IACR) in cooperation with the IndianInstitute of Technology (IIT), Chennai.This year a total of 237 papers were submitted to Asiacrypt 2005. The submis-sions covered all areas of cryptographic research representing the current state ofwork in the crypto community worldwide, includ : Topics Coding and Information Theory Cryptology / Operating Systems / Algorithm Analysis and Problem Complexity / Management of Computing and Information Systems / Computer Communication Networks"
Advances in cryptology - CRYPTO -87 ; Conference on the theory and applications of cryptographic techniques : Proceedings
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. 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. 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.
Acquiring card payments
Covers: Payment cards and protocols / EMV contact chip and contactless transactions / Disputes, arbitration, and compliance / Data security standards in the payment card industry / Validation algorithms / Code tables / Basic cryptography / Pin block formats and algorithms
