Bounded Collusion ABE for TMs from IBE (Q6041291)

scientific article; zbMATH DE number 7689419

Language	Label	Description	Also known as
English	Bounded Collusion ABE for TMs from IBE	scientific article; zbMATH DE number 7689419

Statements

instance of

scholarly article

0 references

title

Bounded Collusion ABE for TMs from IBE (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

26 May 2023

0 references

zbMATH Keywords

iterated simulation security

0 references

random oracle model

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-92068-5_13

0 references

cites work

Simplifying Design and Analysis of Complex Predicate Encryption Schemes

0 references

Functional encryption for Turing machines with dynamic bounded collusion from LWE

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

Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more

0 references

Optimal bounded-collusion secure functional encryption

0 references

Functional Encryption for Turing Machines

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

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

0 references

Q4783728

0 references

Attribute-Based Encryption for Finite Automata from LWE

0 references

On Extractability Obfuscation

0 references

Theory of Cryptography

0 references

Laconic oblivious transfer and its applications

0 references

An Identity Based Encryption Scheme Based on Quadratic Residues

0 references

Q4536817

0 references

Identity-based encryption from the Diffie-Hellman assumption

0 references

From selective IBE to full IBE and selective HIBE

0 references

A Quasipolynomial Reduction for Generalized Selective Decryption on Trees

0 references

Adaptive Security of Constrained PRFs

0 references

Registration-based encryption: removing private-key generator from IBE

0 references

Adaptive garbled RAM from laconic oblivious transfer

0 references

Garbled RAM Revisited

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

ABE for DFA from \(k\)-lin

0 references

Adaptively secure ABE for DFA from \(k\)-Lin and more

0 references

Functional Encryption with Bounded Collusions via Multi-party Computation

0 references

Semi-adaptive Security and Bundling Functionalities Made Generic and Easy

0 references

Public-Coin Differing-Inputs Obfuscation and Its Applications

0 references

Be adaptive, avoid overcommitting

0 references

Adaptive Security of Yao’s Garbled Circuits

0 references

Indistinguishability obfuscation from well-founded assumptions

0 references

Advances in Cryptology – CRYPTO 2004

0 references

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

0 references

Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption

0 references

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

0 references

How to Garble RAM Programs?

0 references

Q4409113

0 references

Fuzzy Identity-Based Encryption

0 references

Identity-Based Cryptosystems and Signature Schemes

0 references

Functional Encryption for Regular Languages

0 references

Identifiers

zbMATH Open document ID

1514.94089

0 references

DOI

10.1007/978-3-030-92068-5_13

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6041291