Q:

"Refined" list of open problems in TCS

In the conference on learning theory (COLT), a list of open problems is published every year, for example, the list of 2019. 
The open problems are being submitted and peer reviewed, which makes this list reliable (in the sense that the problems are well-defined, motivated and "accessible"). 
In the area of sublinear algorithms and property testing, there is this wiki page, which similarity includes a list of open problems. 
My question is: are there similar lists for other areas in TCS (e.g. complexity, cryptography etc.)?  I didn't find such a list in common conferences, and I wonder if there are blogs/websites with a list of known open problems (which are accessible in some sense, i.e. not just "p,np" and problems at that level)

A:

There is a list of open problems in computational geometry.  It is edited and maintained by Demaine, Mitchell, and O'Rourke. 

A:

There is a list of open problems in graph theory and combinatorics collected and maintained by Douglas B. West. 
This page maintains a list of lists of open problems in parameterized complexity.