# Sitemap

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

## Pages

## Posts

## Future Blog Post

** Published:**

This post will show up by default. To disable scheduling of future posts, edit `config.yml`

and set `future: false`

.

## Blog Post number 4

** Published:**

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

## Blog Post number 3

** Published:**

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

## Blog Post number 2

** Published:**

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

## Blog Post number 1

** Published:**

## portfolio

## projects

## Logic of Hide-and-Seek

- We discuss a simple logic to describe the hide-and-seek game, and show that adding an equality constant to describe the winning condition of the seeker makes our logic undecidable.
- Collaborated with Prof. Dazhu Li, Prof. Fenrong Liu and Prof. Sujata Ghosh.
- Published in
*27th Workshop on Logic, Language, Information and Computation*(WoLLIC 2021). - Full version

## Attempts to solve standard lattice problems via qunatum algorithms

- We attempted to solve standard lattice problems via quantum algorithms by first reducing it to a quantum analog of LWE (learning with errors) with special error distribution, and then solving the quantum LWE problem. We closed the first step, leaving the second step open.
- Collaborated with Prof. Yilei Chen, Dr. Qipeng Liu and Zihan Hu.
- Manuscript

## Function secret sharing for multi-point functions

- We propose a new PRG-based function secret sharing scheme to succinctly and additively share multi-point functions. It appears to be the practically fastest solution in most application scenarios (e.g. when used to derive pseudorandom correlation generator for OLEs).
- Collaborated with Prof. Elette Boyle, Prof. Yuval Ishai, Dr. Niv Gilboa and Matan Hamilis.
- Previous manuscript

## On Modal Substitution Logic

- For any monotone function in a complete lattice, one can obtain its least fixed-point by finding the limit of the approximation sequence obtained by starting with the minimal element and iteratively substituting the result of the function to be its input. However if we start with an arbitrary element, or the function is not monotone, then the approximation sequence sometimes oscillates instead of converging. We study the (iterative) substitution over basic modal logic, characterizing its power and applying it to analyze oscillations.
- Discussing with Prof. Johan van Benthem, Prof. Fenrong Liu, Prof. Sujata Ghosh, and Prof. Dazhu Li.