陈隆 (Long Chen)

Associate Professor at Institute of Software Chinese Academy of Sciences. Researcher of cryptography and blockchain.

[陈隆 (Long Chen) @Jason_Chen_Long]

Recently noticed that there are 25 researchers on DBLP with the same name: Long Chen. So when others sign their name, they provided a signature. But when I sign my name, it looks like I provided a ring signature.🤪

[陈隆 (Long Chen) @Jason_Chen_Long]

@GlobalMoney @grok 核查事实，尤其是北京体育局预算的具体数字。

[陈隆 (Long Chen) @Jason_Chen_Long]

@IEEESSP We have significantly improved the efficiency of the NIZK based on MPCith, and have also provided a practical method for managing certificates of lattice KEMs.

[陈隆 (Long Chen) @Jason_Chen_Long]

This week, Qianwen Gao is at @IEEESSP
to present our paper on "MPC-in-the-Head Framework without Repetition and its Applications to the Lattice-based Cryptography".

[Willy Susilo @Wsusilo]

PKC2024 appreciation night

[陈隆 (Long Chen) @Jason_Chen_Long]

@Heum It looks great, so could you pull me in, please?

[陈隆 (Long Chen) @Jason_Chen_Long]

同时欢迎相关方向同学依托中科院软件所申报海外优秀青年基金和中科院海外优秀人才项目🥳

[陈隆 (Long Chen) @Jason_Chen_Long]

🔐 Exciting opportunity for #PostDocs in #PostQuantumCryptography! Join the Institute of Software Chinese Academy of Sciences (ISCAS). 🎓💻
We're seeking two researchers with a passion for designing and implementing cutting-edge post-quantum cryptographic algorithms.

[陈隆 (Long Chen) @Jason_Chen_Long]

Apply by July 30, 2024, for an opportunity to contribute to the future of digital security at a leading Chinese research institute. If you are interested, please feel free to contact me.🥳

#CryptographyJobs #AcademicTwitter #CyberSecurity #QuantumComputing #JobAlert

[Qiang Tang @QiangTang7]

PKC 24 program is up, and registration open! with great papers, awesome invited talks from @sol3gga and @nadiaheninger, exotic excursion and cruise banquet, and the lovely little logo @Wsusilo, see you in Sydney~ https://t.co/suNbyseGaW

[Nick Sullivan @grittygrease]

RFC 9497 has been published!
https://t.co/gRp8XcxGTW
This RFC explores Oblivious Pseudorandom Functions (OPRFs), a cryptographic primitive that provides a way for two parties to jointly compute the output of a pseudorandom function, such that one party learns the output without learning the other's input. Among other applications, OPRFs enable services to decouple credential authentication and use, allowing users to efficiently authenticate to services without compromising their privacy.

[陈隆 (Long Chen) @Jason_Chen_Long]

@martinralbrecht I see. Thanks very much.

[陈隆 (Long Chen) @Jason_Chen_Long]

What sets us apart is our innovative technique that eliminates the need for the MPC protocol in evaluating hash operations, resulting in high concrete efficiency.

[陈隆 (Long Chen) @Jason_Chen_Long]

Exciting news! Our team has just implemented the first lattice-based t-out-of-n threshold signature scheme. Check out our new paper for more details! #latticebased #thresholdsignature #efficiency https://t.co/kcqK20p3zL

[Matthew Green @matthew_d_green]

The EU Council is continuing to debate a law that would require communication providers to scan all communications, potentially including end-to-end encrypted conversations. And they are now debating including audio conversations as well.

[陈隆 (Long Chen) @Jason_Chen_Long]

@BehzadAbdolmal1 @shefcompsci @TampereUni @maxplanckpress @rise Nice work. BTW, I believe it deserves a top-tier conference.

[陈隆 (Long Chen) @Jason_Chen_Long]

@profbodden Use Google Translate. It may not be hard in the AI era.😀

[陈隆 (Long Chen) @Jason_Chen_Long]

Happy to announce our paper https://t.co/e1ihZvaEMl will appear at PKC 23. Joint effort with Giuseppe Ateniese, Danilo Francati
@392_D, Dimitrios Papadopoulos and Qiang Tang @QiangTang7.

Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity

[Tamás Görbe @TamasGorbe]

last year was complex, but it'll all be different this year

inspired by @howie_hua