Constrained verifiable random functions without obfuscation and friends
From MaRDI portal
Cites work
- A generic approach to constructing and proving verifiable random functions
- A Pseudorandom Generator from any One-way Function
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- All in the XL Family: Theory and Practice
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Candidate witness encryption from lattice techniques
- Compact E-Cash and Simulatable VRFs Revisited
- Constrained PRFs for unbounded inputs
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Constrained pseudorandom functions from functional encryption
- Constrained verifiable random functions
- Constrained verifiable random functions from indistinguishability obfuscation
- Constructing verifiable random functions with large input spaces
- Cryptography and Coding
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Exponent-VRFs and their applications
- Functional signatures and pseudorandom functions
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- Non-interactive zero-knowledge from LPN and MQ
- OCash: fully anonymous payments between blockchain light clients
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Optimal broadcast encryption from LWE and pairings in the standard model
- Public Key Cryptography - PKC 2005
- Solving quadratic equations with XL on parallel architectures
- The power of undirected rewindings for adaptive security
- The price of verifiability: lower bounds for verifiable random functions
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable random functions from standard assumptions
- Verifiable random functions from weaker assumptions
- Verifiable random functions with optimal tightness
This page was built for publication: Constrained verifiable random functions without obfuscation and friends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233243)
