Pages that link to "Item:Q1690284"

The following pages link to A generic approach to constructing and proving verifiable random functions (Q1690284):

Displaying 23 items.

• Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
• Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
• Combiners for functional encryption, unconditionally (Q2055605) (← links)
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
• Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
• Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
• Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
• Asymptotically quasi-optimal cryptography (Q2170004) (← links)
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
• From FE combiners to secure MPC and back (Q2175912) (← links)
• Hunting and gathering -- verifiable random functions from standard assumptions with short proofs (Q2289439) (← links)
• Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
• Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
• Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness (Q6085266) (← links)
• Logarithmic-size (linkable) threshold ring signatures in the plain model (Q6113965) (← links)
• The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
• Verifiable Obtained Random Subsets for Improving SPHINCS+ (Q6488404) (← links)
• Practical verifiable random function with RKA security (Q6535499) (← links)
• Registered (inner-product) functional encryption (Q6604926) (← links)