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.
- 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 loss of unique signatures (Q1629431) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- Identity-based quotable ring signature (Q1750014) (← 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)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Batch verification of short signatures (Q1928768) (← links)
- Security analysis of randomize-hash-then-sign digital signatures (Q1928773) (← links)
- Non-interactive multisignatures in the plain public-key model with efficient verification (Q1944042) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Confined guessing: new signatures from standard assumptions (Q2018822) (← links)
- Signcryption from randomness recoverable public key encryption (Q2269814) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- A generic framework for accountable optimistic fair exchange protocol (Q2311072) (← links)
- Efficient fully structure-preserving signatures and shrinking commitments (Q2318093) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Sequential aggregate signatures with short public keys without random oracles (Q2344760) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles (Q2377064) (← links)
- Certificateless signature: a new security model and an improved generic construction (Q2383987) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- A generic construction of tightly secure signatures in the multi-user setting (Q2419110) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← 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)
- Universally composable symbolic security analysis (Q2429708) (← links)