The following pages link to (Q4542539):
Displaying 50 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Provably secure certificateless proxy signature scheme in the standard model (Q301592) (← links)
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles (Q387810) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Concurrent signature without random oracles (Q476860) (← links)
- Timed encryption with application to deniable key exchange (Q477191) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle (Q497143) (← links)
- Non-adaptive programmability of random oracle (Q500974) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Cryptanalysis of a certificateless signcryption scheme in the standard model (Q621650) (← links)
- Chosen ciphertext secure fuzzy identity based encryption without ROM (Q655101) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Distributed ring signatures from general dual access structures (Q851736) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- Non-interactive identity-based threshold signature scheme without random oracles (Q943088) (← links)
- Fully CCA2 secure identity based broadcast encryption without random oracles (Q987813) (← links)
- A synthetic indifferentiability analysis of some block-cipher-based hash functions (Q1009050) (← links)
- Efficient public key encryption with smallest ciphertext expansion from factoring (Q1009067) (← links)
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model (Q1009100) (← links)
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles (Q1034629) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Tightly secure ring signatures in the standard model (Q2235773) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- The magic of ELFs (Q2318089) (← links)
- Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) (← links)
- How (not) to design strong-RSA signatures (Q2430687) (← links)
- A provably secure short signature scheme based on discrete logarithms (Q2456500) (← links)
- Enhancing the security of perfect blind DL-signatures (Q2489230) (← links)
- Fine-grained forward-secure signature schemes without random oracles (Q2489913) (← links)
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold (Q2502164) (← links)
- Generic groups, collision resistance, and ECDSA (Q2572964) (← links)
- Public key encryption with equality test in the standard model (Q2660898) (← links)
- Public-key authenticated encryption with keyword search revisited: security model and constructions (Q2660908) (← links)
