Post-quantum access control with application to secure data retrieval
From MaRDI portal
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Access control encryption for general policies from standard assumptions
- Access control encryption from group encryption
- Adaptive oblivious transfer with access control from lattice assumptions
- An efficient protocol for oblivious DFA evaluation and applications
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Computationally secure oblivious transfer
- Distributed Point Functions and Their Applications
- Efficient 3-party distributed ORAM
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Fast Reed-Solomon interactive oracle proofs of proximity
- Function secret sharing
- Greyhound: fast polynomial commitments from lattices
- Homomorphic encryption with access policies: characterization and new constructions
- How to share a secret
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Inner-product functional encryption with fine-grained access control
- Interactive oracle proofs
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
- Multi-client functional encryption with public inputs and strong security
- Multi-client non-interactive verifiable computation
- Oblivious transfer with hidden access control policies
- Orion: zero knowledge proof with linear prover time
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Publicly verifiable secret sharing
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- Scalable zero knowledge with no trusted setup
- Secret-sharing schemes for general and uniform access structures
- STIR: Reed-Solomon proximity testing with fewer queries
- Streaming and unbalanced PSI from function secret sharing
- Structure-aware private set intersection, with applications to fuzzy matching
- Succinct arguments in the quantum random oracle model
- Unlinkable updatable databases and oblivious transfer with access control
This page was built for publication: Post-quantum access control with application to secure data retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390777)
