| Elliptic Curves A Memory Efficient Version of Satoh' s Algorithm Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy How Secure Are Elliptic Curves over Composite Extension Fields? Commitments Efficient and Non-interactive Non-Malleable Commitment How to Convert the Flavor of a Quantum Bit Commitment Anonymity Cryptographic Counters and Applications to Electronic Voting An Efficient System for Non-transferable AnonyMous Credentials with Optional Anonymity Revocation Priced Oblivious Transfer: How to Sell Digital Goods Signatures and Hash Functions A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures Practical Threshold RSA Signatures without a Trusted Dealer Hash Functions: From Merkle-Damgar to Shoup XTT and NTRU Key Recovery and Message Attacks on NTRU-Composite Evidence that XTP Is More Secure than Supersingular Elliptic Curve Cryptosystems NSS: An NTRU Lattice-Based Signature Scheme Assumptions The Bit Security of Paillier's Encryption Scheme and Its Applications Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference Multiparty Protocols Block Ciphers Primitives Symmetric Ciphers Key Exchange and Multicast Authentication and Identification Author Index |
内容加载中，请稍后...
商品评论（0条）