(Inner-product) functional encryption with updatable ciphertexts (Q6141858): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:49, 30 December 2024

scientific article; zbMATH DE number 7793136

Language	Label	Description	Also known as
English	(Inner-product) functional encryption with updatable ciphertexts	scientific article; zbMATH DE number 7793136

Statements

scholarly article

0 references

(Inner-product) functional encryption with updatable ciphertexts (English)

0 references

0 references

Sebastian Ramacher

0 references

Daniel Slamanig

0 references

Christoph Striecks

0 references

0 references

Journal of Cryptology

0 references

publication date

23 January 2024

0 references

zbMATH Keywords

indistinguishability

0 references

dubbed ciphertext-updatable functional encryption

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s00145-023-09486-y

0 references

Efficient Lattice (H)IBE in the Standard Model

0 references

Simple Functional Encryption Schemes for Inner Products

0 references

From single-input to multi-client inner-product functional encryption

0 references

Decentralizing inner-product functional encryption

0 references

Multi-client inner-product functional encryption in the random-oracle model

0 references

From Selective to Adaptive Security in Functional Encryption

0 references

Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings

0 references

Inner-product functional encryption with fine-grained access control

0 references

Improved proxy re-encryption schemes with applications to secure distributed storage

0 references

Multi-input Inner-Product Functional Encryption from Pairings

0 references

Functional encryption for attribute-weighted sums from \(k\)-Lin

0 references

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

0 references

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions

0 references

0 references

Pattern matching in encrypted stream from inner product encryption

0 references

Functional Encryption: Definitions and Challenges

0 references

Constrained Pseudorandom Functions and Their Applications

0 references

Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices

0 references

Decentralized multi-client functional encryption for inner product

0 references

Offline witness encryption with semi-adaptive security

0 references

Practical fully secure unrestricted inner product functional encryption modulo \(p\)

0 references

Obfuscation of Probabilistic Circuits and Applications

0 references

What about Bob? The inadequacy of CPA security for proxy reencryption

0 references

Revisiting proxy re-encryption: forward secrecy, improved security, and applications

0 references

Improved Short Lattice Signatures in the Standard Model

0 references

Unbounded inner-product functional encryption with succinct keys

0 references

Adaptively secure proxy re-encryption

0 references

Proxy re-encryption and re-signatures from lattices

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Attribute-based encryption for circuits

0 references

Be adaptive, avoid overcommitting

0 references

How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)

0 references

Outsourcing the re-encryption key generation: flexible ciphertext-policy attribute-based proxy re-encryption

0 references

Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

0 references

New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts

0 references

Multi-client functional encryption for linear functions in the standard model from LWE

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Multi-client functional encryption with fine-grained access control

0 references

Attribute-based access control for inner product functional encryption from LWE

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Fuzzy Identity-Based Encryption

0 references

How to use indistinguishability obfuscation

0 references

A Punctured Programming Approach to Adaptively Secure Functional Encryption

0 references

Attribute-hiding predicate encryption in bilinear groups, revisited

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00145-023-09486-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6141858

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6141858&oldid=39723988"