Pages that link to "Item:Q2563542"
From MaRDI portal
The following pages link to Efficient cryptographic schemes provably as secure as subset sum (Q2563542):
Displaying 42 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Pseudo-free families of finite computational elementary abelian \(p\)-groups (Q524639) (← links)
- A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems (Q2175905) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- On the uniformity of distribution of the RSA pairs (Q2701565) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds (Q2980848) (← links)
- Cryptanalysis of the Knapsack Generator (Q3013084) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- QUAD: A Practical Stream Cipher with Provable Security (Q3593092) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- (Q5009532) (← links)
- (Q5075820) (← links)
- (Q5121947) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
- Natural proofs (Q5906823) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Fixed points of the subset sum pseudorandom number generators (Q6101274) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← links)
