scientific article; zbMATH DE number 1759781
From MaRDI portal
Publication:4536804
zbMath0995.94533MaRDI QIDQ4536804
Publication date: 28 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
SoK: how (not) to design and implement post-quantum cryptography ⋮ Another Look at Tightness ⋮ MQ Aggregate Signature Schemes with Exact Security Based on UOV Signature ⋮ On the security of RSA textbook signature scheme on Paillier ciphertext ⋮ Memory-Tight Reductions for Practical Key Encapsulation Mechanisms ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Multi-use and unidirectional identity-based proxy re-encryption schemes ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ The wonderful world of global random oracles ⋮ Sponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length Message ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Key regeneration-free ciphertext-policy attribute-based encryption and its application ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ Cliptography: Clipping the Power of Kleptographic Attacks ⋮ New results and applications for multi-secret sharing schemes ⋮ Identity-Based Batch Provable Data Possession ⋮ On tight security proofs for Schnorr signatures ⋮ A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ Identity-based signature and extended forking algorithm in the multivariate quadratic setting ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Efficient IBS from a new assumption in the multivariate-quadratic setting ⋮ Identity-based chameleon hashing and signatures without key exposure ⋮ Programmable hash functions and their applications ⋮ The cost of adaptivity in security games on graphs ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Attribute-based signatures from RSA ⋮ Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme ⋮ Short undeniable signatures based on group homomorphisms ⋮ Generalized public-key cryptography with tight security ⋮ Improved proxy re-encryption schemes with applications to secure distributed storage ⋮ Non-adaptive programmability of random oracle ⋮ Identity-based ring signatures from RSA ⋮ Optimal security proofs for full domain hash. Revisited ⋮ An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks ⋮ Confined guessing: new signatures from standard assumptions ⋮ Programmable Hash Functions and Their Applications ⋮ Homomorphic Encryption and Signatures from Vector Decomposition ⋮ Private set-intersection with common set-up ⋮ Security of Digital Signature Schemes in Weakened Random Oracle Models ⋮ An enhanced \((t,n)\) threshold directed signature scheme ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Efficient Sequential Aggregate Signed Data ⋮ Public Key Encryption with Searchable Keywords Based on Jacobi Symbols ⋮ Threshold RSA for Dynamic and Ad-Hoc Groups ⋮ Strengthening Security of RSA-OAEP ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Virtual Smart Cards: How to Sign with a Password and a Server ⋮ On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham ⋮ Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security ⋮ Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme ⋮ Generic groups, collision resistance, and ECDSA ⋮ On instantiating the algebraic group model from falsifiable assumptions
