Gee Law’s Blog

《悲惨世界》概念版歌词计划 8

本系列旨在忠实提供 1980 版的《悲惨世界》概念版音乐剧的歌词。距离上次更新(第七篇)已经过去了 9 个月,原因除了变忙没时间精听之外,还有难度的飙升。第八篇就一首,第二幕第一曲 Donnez, donnez,非常长,而且有很多市井话。

《悲惨世界》概念版歌词计划 8

Windows Credential User Interface with secure attention sequence: not even bad

Ever since I used Windows NT (for me, the first Windows NT I used is Windows XP), I’ve been familiar with the importance of Ctrl+Alt+Delete. The combination is known as the secure attention sequence for Windows. In an uninfected copy of Windows, the sequence is handled exclusively by Windows, and is used to thwart trojan dialogs luring users’ credentials. Requiring SAS before Welcome Screen is a quite usable security feature. However, it is not the case for Credential User Interface.

“打开方式”的“打开方式”

——原标题《Windows 文件关联略解》。上古时期一些乱七八糟的软件喜欢瞎搞文件关联,现在情况好多了。这篇博客简略讲述 Windows shell 的文件关联机制(不涉及 URL 协议关联)。这篇文章并不是 Microsoft 官方文档,一切请以官方文档为准。本篇的代码在 GitHub 上可见。

“打开方式”的“打开方式”

Blogging my blog

A meta-blog that keeps the trace of my blog site. RSS output has been adjusted to fit the growth of my blog, and I finally decided to give a sh!t to a long-standing bug of Microsoft Edge and fixed the tiles ‘for them’.

《化学是你,化学是我》歌词(中英文)

《化学是你,化学是我》的英文名是 Chemistry is you, chemistry is me,歌词作者是时任北京大学校长周其凤,歌曲一经发布即获广泛关注并被评论为“天雷滚滚”、《忐忑》后的新神曲。我,化学竞赛的逃兵,突然想起来这首歌,并且之前听过它的英文版,既然是“天雷滚滚”,自然比较配惊蛰,就写这么一篇吧。

《化学是你,化学是我》歌词(中英文)

Windows PowerShell 的二进制管道

PowerShell 在众 shell 中最突出的特色就是面向对象;然而,世界上还有很多命名是专为字节流管道设计的(兼容性大坑)。PowerShell 对待字节流管道那是十分 nasty!我写的这个小工具可以在对象和字节流之间做完美的润滑。更新:Aloxaf 实现了 Linux 版本的 Use-RawPipeline,起名 Use-PosixPipeline。

Allen School 配发的 MacBook

UW CSE 的 PhD 要约信中提到新入学的研究生都会获得一个免费电脑(有多种选择),我选了(标准选项里的)MacBook。这篇博文记录我初探 macOS 的事情。作为探索结果,我居然又给微软报了一个 bug!

Allen School 配发的 MacBook

A note on (non-)uniform reductions

I learnt how to write uniform hybrid reductions in my rudimentary cryptography course, which are beasty beauties that wrap an adversary, trying break each of the many underlying cryptographic assumptions simultaneously. However, those constructions are less easy to write and read than using the transitivity of computational indistinguishability up to polynomially many times. The latter involves writing out the (perhaps polynomially many) hybrids and arguing that adjacent hybrids are indistinguishable. I also learnt non-uniform reductions, noticeably the technique to only work with deterministic adversaries. I’m writing a proof using hybrid argument lately, and I asked my advisor about whether I should write the beast or just the hybrids…

A note on (non-)uniform reductions

Nyuwa mends the epigraph

Nyuwa, the mother goddess of Chinese mythology, mends the sky according to an ancient Chinese legend. Today, Nyuwa is asked to mend the epigraph of a continuous function over an open set so that the function becomes convex. What can we say about this?

Nyuwa mends the epigraph