Pages that link to "Item:Q5307246"
From MaRDI portal
The following pages link to Advances in Cryptology - EUROCRYPT 2004 (Q5307246):
Displaying 50 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- A new universal designated verifier transitive signature scheme for big graph data (Q314806) (← links)
- Unconditionally anonymous ring and mesh signatures (Q321307) (← links)
- How to achieve non-repudiation of origin with privacy protection in cloud computing (Q394727) (← links)
- On the bit security of the weak Diffie-Hellman problem (Q407550) (← links)
- Group-oriented fair exchange of signatures (Q433010) (← links)
- Efficient oblivious transfers with access control (Q453798) (← links)
- Ambiguous optimistic fair exchange: definition and constructions (Q476859) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- Strong key-insulated signature in the standard model (Q615357) (← links)
- Efficient traceable signatures in the standard model (Q631785) (← links)
- Provably secure server-aided verification signatures (Q636553) (← links)
- A new provably secure certificateless short signature scheme (Q636560) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- Identity-based trapdoor mercurial commitments and applications (Q719291) (← links)
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings (Q726463) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices (Q884001) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Secure public-key encryption scheme without random oracles (Q942322) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Time-selective convertible undeniable signatures with short conversion receipts (Q985073) (← links)
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions (Q1006046) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- The twin Diffie-Hellman problem and applications (Q1037234) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy (Q1640423) (← links)
- Shorter double-authentication preventing signatures for small address spaces (Q1653254) (← links)
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
- Improved algebraic MACs and practical keyed-verification anonymous credentials (Q1698653) (← links)
- Short digital signatures and ID-KEMs via truncation collision resistance (Q1710598) (← links)
- How to protect privacy in optimistic fair exchange of digital signatures (Q1750341) (← links)
- Secure simultaneous bit extraction from Koblitz curves (Q1755988) (← links)
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
- Research on attacking a special elliptic curve discrete logarithm problem (Q1793291) (← links)
- Short and efficient convertible undeniable signature schemes without random oracles (Q1945933) (← links)
- Efficient digital signatures from RSA without random oracles (Q1999174) (← links)
- Blockchain-based two-party fair contract signing scheme (Q2023216) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- Skipping the \(q\) in group signatures (Q2152050) (← links)
