Pages that link to "Item:Q3168269"
From MaRDI portal
The following pages link to Number-theoretic constructions of efficient pseudo-random functions (Q3168269):
Displaying 50 items.
- Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers (Q310312) (← links)
- Provably-secure time-bound hierarchical key assignment schemes (Q431793) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Enhanced Boolean functions suitable for the filter model of pseudo-random generator (Q494592) (← links)
- The communication complexity of addition (Q519955) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- On the linear complexity of the Naor-Reingold sequence with elliptic curves (Q708437) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Batch verifiable computation of outsourced functions (Q887441) (← links)
- A convertible multi-authenticated encryption scheme for group communications (Q942321) (← links)
- On the period of the Naor-Reingold sequence (Q975477) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Zeta functions, one-way functions, and pseudorandom number generators. (Q1362085) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem (Q1750339) (← links)
- Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions (Q1755993) (← links)
- Optimal characteristic polynomials for digital multistep pseudorandom numbers (Q1822442) (← links)
- On the linear complexity of the Naor-Reingold sequence (Q1944149) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Group signatures with user-controlled and sequential linkability (Q2061926) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- Polynomial interpolation of the Naor-Reingold pseudo-random function (Q2363385) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness (Q2413008) (← links)
- A one-time stegosystem and applications to efficient covert communication (Q2442646) (← links)
- Extended dual system group and shorter unbounded hierarchical identity based encryption (Q2630713) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Secure parameterized pattern matching (Q2663480) (← links)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
- Oblivious pseudorandom functions from isogenies (Q2692394) (← links)
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF (Q2692395) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security (Q2811127) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- Building a pseudorandom function using a Naor-Reingold type construction (Q2869410) (← links)
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products (Q2946902) (← links)
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) (← links)
