The following pages link to The Uber-Assumption Family (Q3600492):
Displayed 36 items.
- An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
- A bunch of broken schemes: a simple yet powerful linear approach to analyzing security of attribute-based encryption (Q826248) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Improving revocation for group signature with redactable signature (Q2061923) (← links)
- A classification of computational assumptions in the algebraic group model (Q2096519) (← links)
- Don't tamper with dual system encryption. Beyond polynomial related-key security of IBE (Q2096618) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Skipping the \(q\) in group signatures (Q2152050) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (Q2293188) (← links)
- Predicate encryption supporting disjunctions, polynomial equations, and inner products (Q2377068) (← links)
- Automated analysis of cryptographic assumptions in generic group models (Q2423840) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Dynamic multi-client searchable symmetric encryption with support for Boolean queries (Q2656778) (← links)
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice (Q2678984) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Privacy-preserving pattern matching on encrypted data (Q2692382) (← links)
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions (Q2953792) (← links)
- The Kernel Matrix Diffie-Hellman Assumption (Q2958145) (← links)
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem (Q3392897) (← links)
- A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials (Q3460098) (← links)
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs (Q5418497) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- Séta: Supersingular Encryption from Torsion Attacks (Q6041286) (← links)
- The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299) (← links)
- Multi-input non-interactive functional encryption: constructions and applications (Q6057217) (← links)
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption (Q6067364) (← links)
- A practical compiler for attribute-based encryption: new decentralized constructions and more (Q6080899) (← links)
- On the security of functional encryption in the generic group model (Q6095189) (← links)
- TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks (Q6103078) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
- Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)
- Secure-channel free certificateless searchable public key authenticated encryption with keyword search (Q6173112) (← links)