| Foundations On the（Im）possibility of Obfuscating Programs Universally Composable Commitments Traitor Tracing Revocation and Tracing Schemes for Stateless Receivers Self Protecting Pirates and Black-Box Traitor Tracing Multi-party Computation Minimal Complete Primitives for Secure Multi-party Computation Robustness for Free in Unconditional Multi-party Computation Secure Distributed Linear Algebra in a Constant Number of Rounds Two-Party Computation Two-Party Generation of DSA Signatures Oblivious Transfer in the Bounded Storage Model Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation Elliptic Curves Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms On the Unpredictability of Bits of the Elliptic Curve Diffie-Hellman Scheme Identity-Based Encryption from the Weil Pairing OAEP A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding（OAEP）as Standardized in PKCS #1 v2. OAEP Reconsidered RSA-OAEP Is Secure under the RSA Assumption Simplified OAEP for the RSA and Rabin Functions Encryption and Authentication Online Ciphers and the H~h-CBC Construction The Order of Encryption and Authentication for Protecting Communications（or：How Secure Is SSL？） Signature Schemes Forward-Secure Signatures with Optimal Signing and Verifying Improved Online/Offline Signature Schemes Protocols An Efficient Scheme for Proving a Shuffle An Identity Escrow Scheme with Appointed Verifiers Session-Key Generation Using Human Passwords Only Cryptanalysis Cryptanalysis of RSA Signatures with Fixed-Pattern Padding Correlation Analysis of the Shrinking Generator Applications of Groups and Codes Broadcadt and Secret Sharing Soundness and Zero-Knowledge Author Index |
内容加载中，请稍后...
商品评论（0条）