The Uber-Assumption Family
From MaRDI portal
Publication:3600492
DOI10.1007/978-3-540-85538-5_3zbMath1186.94427MaRDI QIDQ3600492
Publication date: 10 February 2009
Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_3
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, On Removing Graded Encodings from Functional Encryption, Discrete logarithm problems with auxiliary inputs, Séta: Supersingular Encryption from Torsion Attacks, The One-More Discrete Logarithm Assumption in the Generic Group Model, Multi-input non-interactive functional encryption: constructions and applications, Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption, A practical compiler for attribute-based encryption: new decentralized constructions and more, On the security of functional encryption in the generic group model, TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks, The price of verifiability: lower bounds for verifiable random functions, Beyond Uber: instantiating generic groups via PGGs, Secure-channel free certificateless searchable public key authenticated encryption with keyword search, An algebraic framework for Diffie-Hellman assumptions, A bunch of broken schemes: a simple yet powerful linear approach to analyzing security of attribute-based encryption, Practical homomorphic message authenticators for arithmetic circuits, Linearly-homomorphic signatures and scalable mix-nets, Improving revocation for group signature with redactable signature, A classification of computational assumptions in the algebraic group model, Don't tamper with dual system encryption. Beyond polynomial related-key security of IBE, On instantiating the algebraic group model from falsifiable assumptions, Skipping the \(q\) in group signatures, Multilinear maps from obfuscation, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks, Predicate encryption supporting disjunctions, polynomial equations, and inner products, Automated analysis of cryptographic assumptions in generic group models, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Dynamic multi-client searchable symmetric encryption with support for Boolean queries, Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice, Succinct functional commitment for a large class of arithmetic circuits, Privacy-preserving pattern matching on encrypted data, Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions, The Kernel Matrix Diffie-Hellman Assumption, Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials
