Pages that link to "Item:Q5261668"

The following pages link to Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions (Q5261668):

Displaying 37 items.

• Revocable attribute-based proxy re-encryption (Q2048189) (← links)
• Extracting randomness from extractor-dependent sources (Q2055613) (← links)
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
• On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
• Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
• Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
• Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← links)
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions (Q2149832) (← links)
• Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
• Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
• Attribute-based proxy re-encryption from standard lattices (Q2661778) (← links)
• Adaptively secure inner product encryption from LWE (Q2691591) (← links)
• Improving speed and security in updatable encryption schemes (Q2691598) (← links)
• Incremental symmetric puncturable encryption with support for unbounded number of punctures (Q2697484) (← links)
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption (Q3297610) (← links)
• Watermarking Cryptographic Capabilities (Q4561266) (← links)
• Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
• Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
• Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765) (← links)
• Constraining Pseudorandom Functions Privately (Q5738766) (← links)
• Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
• Cryptography with Updates (Q5738983) (← links)
• Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)
• Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
• Backward private dynamic searchable encryption with update pattern (Q6494606) (← links)
• Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
• Time-lock puzzles with efficient batch solving (Q6636509) (← links)
• Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
• Full quantum equivalence of group action DLog and CDH, and more (Q6639503) (← links)
• Laconic function evaluation and ABE for RAMs from (Ring-)LWE (Q6652894) (← links)
• Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices (Q6652896) (← links)
• Shuffle arguments based on subset-checking (Q6660397) (← links)