Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …

Recent studies have discovered that Chain-of-Thought prompting (CoT) can dramatically
improve the performance of Large Language Models (LLMs), particularly when dealing with …

Algorithmic reasoning requires capabilities which are most naturally understood through
recurrent models of computation, like the Turing machine. However, Transformer models …

In this work, we study indistinguishability obfuscation and functional encryption for general
circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 …

We finally close the long-standing problem of constructing a noninteractive zero-knowledge
(NIZK) proof system for any NP language with security based on the plain Learning With …

Software obfuscation has been developed for over 30 years. A problem always confusing
the communities is what security strength the technique can achieve. Nowadays, this …

We propose a fully homomorphic encryption scheme--ie, a scheme that allows one to
evaluate circuits over encrypted data without being able to decrypt. Our solution comes in …

We propose the first fully homomorphic encryption scheme, solving an old open problem.
Such a scheme allows one to compute arbitrary functions over encrypted data without the …

Communication complexity is the mathematical study of scenarios where several parties
need to communicate to achieve a common goal, a situation that naturally appears during …

How to play any mental game, or a completeness theorem for protocols with honest majority
Page 1 13How to Play Any Mental Game: A Completeness Theorem for Protocols with Honest …