Candidate iO from homomorphic encryption schemes (Q6109075)

scientific article; zbMATH DE number 7719404

Language	Label	Description	Also known as
English	Candidate iO from homomorphic encryption schemes	scientific article; zbMATH DE number 7719404

Statements

instance of

scholarly article

0 references

title

Candidate iO from homomorphic encryption schemes (English)

0 references

0 references

0 references

0 references

0 references

Journal of Cryptology

0 references

publication date

26 July 2023

0 references

zbMATH Keywords

foundations

0 references

obfuscation

0 references

homomorphic encryption

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-023-09471-5

0 references

cites work

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

0 references

Faster Bootstrapping with Polynomial Error

0 references

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

0 references

Indistinguishability Obfuscation from Compact Functional Encryption

0 references

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps

0 references

How to Garble Arithmetic Circuits

0 references

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

0 references

Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)

0 references

Protecting Obfuscation against Algebraic Attacks

0 references

Q4783716

0 references

Bounded Key-Dependent Message Security

0 references

Sum-of-squares meets program obfuscation, revisited

0 references

From Cryptomania to Obfustopia Through Secret-Key Functional Encryption

0 references

Indistinguishability Obfuscation from Functional Encryption

0 references

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

0 references

Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles

0 references

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

0 references

Lattice-based FHE as secure as PKE

0 references

Cryptanalyses of Candidate Branching Program Obfuscators

0 references

Cryptanalysis of the Multilinear Map over the Integers

0 references

Practical Multilinear Maps over the Integers

0 references

Q2724587

0 references

Succinct LWE sampling, random polynomials, and obfuscation

0 references

Sanitization of FHE Ciphertexts

0 references

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Two-Round Secure MPC from Indistinguishability Obfuscation

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Secure Obfuscation in a Weak Multilinear Map Model

0 references

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

0 references

Indistinguishability obfuscation from circular security

0 references

Fully homomorphic encryption using ideal lattices

0 references

Graph-Induced Multilinear Maps from Lattices

0 references

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Reusable garbled circuits and succinct functional encryption

0 references

Q2707439

0 references

Counterexamples to new circular security assumptions underlying iO

0 references

Cryptanalysis of GGH Map

0 references

Amplifying the security of functional encryption, unconditionally

0 references

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

0 references

Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)

0 references

Indistinguishability obfuscation from well-founded assumptions

0 references

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes

0 references

Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs

0 references

Indistinguishability Obfuscation with Non-trivial Efficiency

0 references

Indistinguishability obfuscation from trilinear maps and block-wise local PRGs

0 references

Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

Homomorphic time-lock puzzles and applications

0 references

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

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

Pseudorandomness of ring-LWE for any ring and modulus

0 references

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

0 references

How to use indistinguishability obfuscation

0 references

Candidate obfuscation via oblivious LWE sampling

0 references

Identifiers

zbMATH Open document ID

1518.94048

0 references

DOI

10.1007/s00145-023-09471-5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6109075