The following pages link to Amin Sakzad (Q540390):
Displayed 31 items.
- On cycle-free lattices with high rate label codes (Q540391) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- Middle-product Learning with Errors (Q1675205) (← links)
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE (Q1675207) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Cycle structure of permutation functions over finite fields and their applications (Q1760069) (← links)
- Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0) (Q1784493) (← links)
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security (Q2055676) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Post-quantum ID-based ring signatures from symmetric-key primitives (Q2096649) (← links)
- FPPW: a fair and privacy preserving watchtower for bitcoin (Q2147238) (← links)
- Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- An efficient non-interactive multi-client searchable encryption with support for Boolean queries (Q2165467) (← links)
- DGM: a \underline{D}ynamic and revocable \underline{G}roup \underline{M}erkle signature (Q2167769) (← links)
- Lattice RingCT v2.0 with multiple input and multiple output wallets (Q2183923) (← links)
- Short lattice-based one-out-of-many proofs and applications to ring signatures (Q2291378) (← links)
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
- Codes with girth 8 Tanner graph representation (Q2638415) (← links)
- Incremental symmetric puncturable encryption with support for unbounded number of punctures (Q2697484) (← links)
- On the performance of 1-level LDPC lattices (Q3001403) (← links)
- Ambiguity and deficiency of reversed Dickson permutations (Q3187301) (← links)
- Public-Key Puncturable Encryption: Modular and Compact Constructions (Q5041162) (← links)
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers (Q5041226) (← links)
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers (Q5211771) (← links)
- Two New Measures for Permutations: Ambiguity and Deficiency (Q5272262) (← links)
- Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map (Q5346379) (← links)
- Integer-valued polynomials over subsets of matrix rings (Q5743054) (← links)
- An injectivity analysis of Crystals-Kyber and implications on quantum security (Q6108794) (← links)