Pages that link to "Item:Q1648779"
From MaRDI portal
The following pages link to On the bit security of cryptographic primitives (Q1648779):
Displaying 29 items.
- Computing OR on a randomized fixed adversary CRCW PRAM (Q287164) (← links)
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes (Q497226) (← links)
- Security of most significant bits of \(g^{x^{2}}\). (Q1853041) (← links)
- Secure pseudorandom bit generators and point sets with low star-discrepancy (Q2029676) (← links)
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments (Q2044755) (← links)
- Security under message-derived keys: signcryption in iMessage (Q2055665) (← links)
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security (Q2055676) (← links)
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions (Q2061985) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- Tighter proofs of CCA security in the quantum random oracle model (Q2175932) (← links)
- DRAT-based bit-vector proofs in CVC4 (Q2181940) (← links)
- Another look at tightness. II: Practical issues in cryptography (Q2412214) (← links)
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security (Q2697891) (← links)
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives (Q2790034) (← links)
- Bit Security of the CDH Problems over Finite Fields (Q2807226) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- On the Security of the Schnorr Scheme using Preprocessing (Q4037452) (← links)
- On the Bit Security of NTRUEncrypt (Q4414698) (← links)
- Primitivity of PRESENT and other lightweight ciphers (Q4563587) (← links)
- (Q4941817) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths (Q5137709) (← links)
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem (Q6104345) (← links)
- Securing approximate homomorphic encryption using differential privacy (Q6155269) (← links)
- Bit security as computational cost for winning games with high probability (Q6157548) (← links)
- A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model (Q6176275) (← links)
- Efficient updatable public-key encryption from lattices (Q6604934) (← links)
- Unified view for notions of bit security (Q6605331) (← links)
- SoK: learning with errors, circular security, and fully homomorphic encryption (Q6635900) (← links)
