Lockable obfuscation from circularly insecure fully homomorphic encryption (Q6169028)

scientific article; zbMATH DE number 7724833

Language	Label	Description	Also known as
English	Lockable obfuscation from circularly insecure fully homomorphic encryption	scientific article; zbMATH DE number 7724833

Statements

instance of

scholarly article

0 references

title

Lockable obfuscation from circularly insecure fully homomorphic encryption (English)

0 references

author

Kamil Kluczniak

0 references

published in

Public-Key Cryptography – PKC 2022

0 references

publication date

10 August 2023

0 references

zbMATH Keywords

indistinguishability obfuscation

0 references

circular insecure encryption

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-97131-1_3

0 references

cites work

Cryptographic Agility and Its Relation to Circular Encryption

0 references

Public-Key Encryption in the Bounded-Retrieval Model

0 references

Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation

0 references

Simultaneous Hardcore Bits and Cryptography against Memory Attacks

0 references

Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification

0 references

Learning with Rounding, Revisited

0 references

Secure quantum extraction protocols

0 references

Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE

0 references

Candidate iO from homomorphic encryption schemes

0 references

Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability

0 references

Q4783716

0 references

On the (im)possibility of obfuscating programs

0 references

Sum-of-squares meets program obfuscation, revisited

0 references

New Circular Security Counterexamples from Decision Linear and Learning with Errors

0 references

A simple obfuscation scheme for pattern-matching with wildcards

0 references

Weak zero-knowledge beyond the black-box barrier

0 references

Upgrading to functional encryption

0 references

New techniques for obfuscating conjunctions

0 references

Anonymous IBE, leakage resilience and circular security from new assumptions

0 references

Obfuscating Conjunctions

0 references

Point-Function Obfuscation: A Framework and Generic Constructions

0 references

Post-quantum zero knowledge in constant rounds

0 references

Obfuscating conjunctions under entropic ring LWE

0 references

Obfuscating simple functionalities from knowledge assumptions

0 references

Q4364570

0 references

Obfuscating Point Functions with Multibit Output

0 references

New Definitions and Separations for Circular Security

0 references

On Symmetric Encryption and Point Obfuscation

0 references

Obfuscation of Hyperplane Membership

0 references

Traitor-tracing from LWE made simple and attribute-based

0 references

GGH15 beyond permutation branching programs: proofs, attacks, and candidates

0 references

Public-Key Encryption Schemes with Auxiliary Inputs

0 references

Efficient Public-Key Cryptography in the Presence of Key Leakage

0 references

On cryptography with auxiliary input

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Correcting errors without leaking partial information

0 references

Fully homomorphic encryption using ideal lattices

0 references

Graph-Induced Multilinear Maps from Lattices

0 references

Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

0 references

On perfect correctness in (lockable) obfuscation

0 references

Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

0 references

Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption

0 references

Collusion resistant traitor tracing from learning with errors

0 references

Q4787198

0 references

On the (Im)Possibility of Key Dependent Encryption

0 references

A Pseudorandom Generator from any One-way Function

0 references

Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

0 references

Q3840170

0 references

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

0 references

Lockable obfuscation from circularly insecure fully homomorphic encryption

0 references

Separations in Circular Security for Arbitrary Length Key Cycles

0 references

Circular Security Separations for Arbitrary Length Cycles from LWE

0 references

Another step towards realizing random oracles: non-malleable point obfuscation

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Indistinguishability Obfuscation with Non-trivial Efficiency

0 references

Indistinguishability obfuscation from trilinear maps and block-wise local PRGs

0 references

Public-Key Cryptosystems Resilient to Key Leakage

0 references

A Leakage-Resilient Mode of Operation

0 references

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

0 references

On the Circular Security of Bit-Encryption

0 references

On obfuscating point functions

0 references

Candidate obfuscation via oblivious LWE sampling

0 references

Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

0 references

The Magic of ELFs

0 references

Identifiers

zbMATH Open document ID

1519.94146

0 references

DOI

10.1007/978-3-030-97131-1_3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6169028