The following pages link to (Q3374913):
Displaying 50 items.
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds (Q1648810) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- Efficient certificateless anonymous multi-receiver encryption scheme without bilinear parings (Q1720413) (← links)
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model (Q1801090) (← links)
- Public key signatures in the multi-user setting. (Q1853080) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
- Tightly-secure authenticated key exchange, revisited (Q2056675) (← links)
- More efficient digital signatures with tight multi-user security (Q2061945) (← links)
- Multi-user BBB security of public permutations based MAC (Q2088959) (← links)
- Handling adaptive compromise for practical encryption schemes (Q2096475) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys (Q2101200) (← links)
- Short identity-based signatures with tight security from lattices (Q2118556) (← links)
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting (Q2129001) (← links)
- Tightness subtleties for multi-user PKE notions (Q2149787) (← links)
- Multi-designated receiver signed public key encryption (Q2170065) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting (Q2192382) (← links)
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions (Q2205895) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Generalized public-key cryptography with tight security (Q2225176) (← links)
- Public key encryption with filtered equality test revisited (Q2232126) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption (Q2402372) (← links)
- Connecting tweakable and multi-key blockcipher security (Q2413014) (← links)
- Sharing many secrets with computational provable security (Q2444772) (← links)
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors (Q2692341) (← links)
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications (Q2692345) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- Completeness of Single-Bit Projection-KDM Security for Public Key Encryption (Q2790040) (← links)
- Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography (Q2796128) (← links)
- Non-Malleable Encryption: Simpler, Shorter, Stronger (Q2796130) (← links)
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security (Q2835581) (← links)
- The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 (Q2835590) (← links)
- Ad-hoc threshold broadcast encryption with shorter ciphertexts (Q2864362) (← links)
- Computational soundness of symbolic analysis for protocols using hash functions (Q2866733) (← links)
- Another Look at Tightness (Q2889878) (← links)
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption (Q2890017) (← links)
- Salvaging Weak Security Bounds for Blockcipher-Based Constructions (Q2958132) (← links)
- Signcryption Schemes Based on the Diffie–Hellman Problem (Q3000030) (← links)
- Towards Tightly Secure Deterministic Public Key Encryption (Q3297488) (← links)
- Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting (Q3297618) (← links)
- CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts (Q3503869) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
- Strengthening Security of RSA-OAEP (Q3623061) (← links)
