The following pages link to (Q3374913):
Displaying 33 items.
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks (Q3627444) (← links)
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols (Q3631369) (← links)
- Certified Encryption Revisited (Q3637140) (← links)
- Automating Computational Proofs for Public-Key-Based Key Exchange (Q4933211) (← links)
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms (Q5041159) (← links)
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes (Q5041167) (← links)
- Adaptive Partitioning (Q5270372) (← links)
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (Q5387100) (← links)
- Efficient and Provably Secure Certificateless Multi-receiver Signcryption (Q5505458) (← links)
- The Multi-user Security of Double Encryption (Q5738981) (← links)
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions (Q5896157) (← links)
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting (Q6041292) (← links)
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model (Q6085265) (← links)
- KDM security for the Fujisaki-Okamoto transformations in the QROM (Q6113959) (← links)
- Lattice-based signatures with tight adaptive corruptions and more (Q6113962) (← links)
- Puncturable key wrapping and its applications (Q6132430) (← links)
- Compact structure-preserving signatures with almost tight security (Q6134421) (← links)
- A modular approach to the security analysis of two-permutation constructions (Q6135404) (← links)
- Authenticated encryption with key identification (Q6135432) (← links)
- Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)
- Simulation-based bi-selective opening security for public key encryption (Q6157527) (← links)
- Luby-Rackoff backwards with more users and more security (Q6157554) (← links)
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting (Q6192061) (← links)
- Bringing order to chaos: the case of collision-resistant chameleon-hashes (Q6595845) (← links)
- Multi-user security of the Elephant v2 authenticated encryption mode (Q6618587) (← links)
- A sponge-based PRF with good multi-user security (Q6619860) (← links)
- SoK: public key encryption with openings (Q6635892) (← links)
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions (Q6635894) (← links)
- The multi-user security of MACs via universal hashing in the ideal cipher model (Q6636105) (← links)
- Toothpicks: more efficient fork-free two-round multi-signatures (Q6636401) (← links)
- Key exchange with tight (full) forward secrecy via key confirmation (Q6637715) (← links)
- Information-theoretic security with asymmetries (Q6652930) (← links)
- Practical traceable receipt-free encryption (Q6660398) (← links)
