Pages that link to "Item:Q3787914"
From MaRDI portal
The following pages link to A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (Q3787914):
Displayed 50 items.
- Chosen ciphertext secure authenticated group communication using identity-based signcryption (Q604107) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Efficient discrete logarithm based multi-signature scheme in the plain public key model (Q849361) (← 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)
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) (← links)
- A simple transitive signature scheme for directed trees (Q924159) (← links)
- Certificate-based verifiably encrypted signatures from pairings (Q924671) (← links)
- Non-interactive identity-based threshold signature scheme without random oracles (Q943088) (← links)
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- Two-factor mutual authentication based on smart cards and passwords (Q955348) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Rogue-key attacks on the multi-designated verifiers signature scheme (Q963405) (← links)
- A one-time signature using run-length encoding (Q975441) (← links)
- Time-selective convertible undeniable signatures with short conversion receipts (Q985073) (← links)
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm (Q1021246) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Batch RSA (Q1363068) (← links)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- Improving the exact security of digital signature schemes (Q1596365) (← links)
- On the security of RSA with primes sharing least-significant bits (Q1762562) (← links)
- Public key signatures in the multi-user setting. (Q1853080) (← links)
- Robust threshold DSS signatures (Q1854399) (← links)
- How to sign digital streams (Q1854413) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- Signcryption from randomness recoverable public key encryption (Q2269814) (← links)
- Certificateless signature: a new security model and an improved generic construction (Q2383987) (← links)
- Short signatures without random oracles and the SDH assumption in bilinear groups (Q2425530) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- A provably secure short signature scheme based on discrete logarithms (Q2456500) (← links)
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks (Q2456502) (← links)
- Hybrid proxy multisignature: a new type multi-party signature (Q2465334) (← links)
- Towards a theory of data entanglement (Q2465624) (← links)
- New \((t, n)\) threshold directed signature scheme with provable security (Q2466072) (← links)
- Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs (Q2481774) (← links)
- Cryptanalysis of ISO/IEC 9796-1 (Q2482334) (← links)
- Breaking and fixing public-key Kerberos (Q2482453) (← links)
- Fine-grained forward-secure signature schemes without random oracles (Q2489913) (← links)
- Cryptanalysis of some signature schemes with message recovery (Q2572002) (← links)
- Generic groups, collision resistance, and ECDSA (Q2572964) (← links)
- Signcryption with non-interactive non-repudiation (Q2572979) (← links)
- Provable security of digital signatures in the tamper-proof device model (Q3184555) (← links)
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles (Q3392898) (← links)
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures (Q3392908) (← links)
- Universally Composable Adaptive Priced Oblivious Transfer (Q3392915) (← links)
- A Storage Efficient Redactable Signature in the Standard Model (Q3399214) (← links)