Pages that link to "Item:Q3168269"
From MaRDI portal
The following pages link to Number-theoretic constructions of efficient pseudo-random functions (Q3168269):
Displaying 41 items.
- Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting (Q2953791) (← links)
- Subliminal Hash Channels (Q3294875) (← links)
- Distributed Pseudorandom Functions for General Access Structures in NP (Q3297480) (← links)
- Public-Key Encryption Schemes with Auxiliary Inputs (Q3408205) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Multilinear Pseudorandom Functions (Q3448796) (← links)
- From Selective to Adaptive Security in Functional Encryption (Q3457089) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- On Optimal GFSR Pseudorandom Number Generators (Q3787342) (← links)
- (Q3974094) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q4612482) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4625103) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Pseudo-Derandomizing Learning and Approximation (Q5009554) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- New Proof for BKP IBE Scheme and Improvement in the MIMC Setting (Q5056014) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function (Q5267798) (← links)
- Adaptive Partitioning (Q5270372) (← links)
- McCulloch-Pitts Brains and Pseudorandom Functions (Q5380437) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Tightly Secure IBE Under Constant-Size Master Public Key (Q5738788) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- On the uniformity of distribution of the Naor-Reingold pseudo-random function (Q5941622) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- Count me in! Extendability for threshold ring signatures (Q6113963) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6134842) (← links)
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions (Q6162383) (← links)
- Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)
- Robustly reusable fuzzy extractor from isogeny (Q6589832) (← links)
- Towards tightly secure short linearly homomorphic signatures (Q6613999) (← links)
- Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption (Q6617632) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)
- Adaptively secure BLS threshold signatures from DDH and co-CDH (Q6653010) (← links)
