Attribute based encryption for deterministic finite automata from DLIN (Q2175933)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Attribute based encryption for deterministic finite automata from DLIN

scientific article; zbMATH DE number 7195437

Language	Label	Description	Also known as
default for all languages	No label defined
English	Attribute based encryption for deterministic finite automata from DLIN	scientific article; zbMATH DE number 7195437

Statements

instance of

scholarly article

0 references

title

Attribute based encryption for deterministic finite automata from DLIN (English)

0 references

0 references

0 references

0 references

30 April 2020

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-36033-7_4

0 references

cites work

A study of pair encodings: predicate encryption in prime order groups

0 references

Functional encryption for inner product predicates from learning with errors

0 references

FE and iO for Turing machines from minimal assumptions

0 references

Attribute-based encryption (and more) for nondeterministic finite automata from LWE

0 references

Attribute based encryption for deterministic finite automata from DLIN

0 references

Reusable garbled deterministic finite automata from learning with errors

0 references

Functional Encryption for Turing Machines

0 references

Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps

0 references

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13

0 references

Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more

0 references

Dual system encryption framework in prime-order groups via computational pair encodings

0 references

Conversions among several classes of predicate encryption and applications to ABE with various compactness tradeoffs

0 references

Q4783716

0 references

Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits

0 references

Generalized Identity Based and Broadcast Encryption Schemes

0 references

Conjunctive, Subset, and Range Queries on Encrypted Data

0 references

Attribute-based encryption for finite automata from LWE

0 references

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security

0 references

Improved dual system ABE in prime-order groups via predicate encodings

0 references

Unbounded ABE via bilinear entropy expansion, revisited

0 references

Fully, (Almost) Tightly Secure IBE and Dual System Groups

0 references

Semi-adaptive attribute-based encryption and improved delegation for Boolean formula

0 references

Cryptanalysis of the multilinear map over the integers

0 references

Cryptanalysis of the new CLT multilinear map over the integers

0 references

An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero

0 references

Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations

0 references

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Candidate indistinguishability obfuscation and functional encryption for all circuits

0 references

Witness encryption and its applications

0 references

How to run Turing machines on encrypted data

0 references

Reusable garbled circuits and succinct functional encryption

0 references

ABE for DFA from \(k\)-lin

0 references

Attribute-based encryption for circuits

0 references

Predicate encryption for circuits from LWE

0 references

Riding on asymmetry: efficient ABE for branching programs

0 references

Semi-adaptive security and bundling functionalities made generic and easy

0 references

Cryptanalysis of GGH map

0 references

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

0 references

Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously

0 references

Bilinear entropy expansion from the decisional linear assumption

0 references

Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin

0 references

Tools for simulating features of composite order bilinear groups in the prime order setting

0 references

New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts

0 references

Unbounded HIBE and Attribute-Based Encryption

0 references

Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption

0 references

New proof methods for attribute-based encryption: achieving full security through selective techniques

0 references

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

0 references

Fully secure functional encryption with general relations from the decisional linear assumption

0 references

Fully secure unbounded inner-product and attribute-based encryption

0 references

Efficient statically-secure large-universe multi-authority attribute-based encryption

0 references

Fuzzy Identity-Based Encryption

0 references

Functional encryption for regular languages

0 references

Dual System Encryption via Predicate Encodings

0 references

Identifiers

zbMATH Open document ID

1455.94102

0 references

DOI

10.1007/978-3-030-36033-7_4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2175933