Pages that link to "Item:Q5739205"
From MaRDI portal
The following pages link to On the Impossibility of Tight Cryptographic Reductions (Q5739205):
Displaying 38 items.
- Security of BLS and BGLS signatures in a multi-user setting (Q680920) (← links)
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- Practical isogeny-based key-exchange with optimal tightness (Q832367) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem (Q1996838) (← links)
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments (Q2044755) (← links)
- Tightly-secure authenticated key exchange, revisited (Q2056675) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- More efficient digital signatures with tight multi-user security (Q2061945) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols (Q2117066) (← links)
- Authenticated key exchange and signatures with tight security in the standard model (Q2139653) (← links)
- Tightness subtleties for multi-user PKE notions (Q2149787) (← links)
- Optimal tightness for chain-based unique signatures (Q2170062) (← links)
- On the concrete security of TLS 1.3 PSK mode (Q2170074) (← links)
- A formal security analysis of the Signal messaging protocol (Q2210444) (← links)
- Generalized public-key cryptography with tight security (Q2225176) (← links)
- Another look at tightness. II: Practical issues in cryptography (Q2412214) (← links)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge (Q2416940) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss (Q2697915) (← 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)
- Lattice-based signatures with tight adaptive corruptions and more (Q6113962) (← links)
- Adaptive multiparty NIKE (Q6114272) (← links)
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model (Q6157502) (← links)
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness (Q6157528) (← links)
- On the multi-user security of LWE-based NIKE (Q6587945) (← links)
- On proving equivalence class signatures secure from non-interactive assumptions (Q6635743) (← links)
- SoK: public key encryption with openings (Q6635892) (← links)
- Toothpicks: more efficient fork-free two-round multi-signatures (Q6636401) (← links)
- New limits of provable security and applications to ElGamal encryption (Q6637527) (← links)
