Embedded Files
About Us
About Us
The Cryptographic Protocols Research Group was one of the research groups in Simula UiB, Bergen, Norway. It consisted of one permanent employee and several postdocs and Ph.D. students. The group was started in 2019 with the hire of Helger Lipmaa and dissolved in 2023 when Helger left Simula UiB.
Research Topics
Research Topics
The research group performs research in the generic area of cryptographic protocols. A cryptographic protocol is a protocol between two or more participants that stays secure even in the presence of malicious entities (even insiders). Some classical examples are key exchange and authentication. A very modern example, aligned with our interests, is zk-SNARK (zero-knowledge succinct non-interactive argument of knowledge), used in cryptocurrencies and verifiable computation.
In more detail, we are interested in
Design of efficient (non-interactive) zero-knowledge arguments
Communicationally and computationally efficient zk-SNARKs
Efficient (NI)ZK arguments based on weak assumptions
E-voting, esp. including
Verifiable (zero-knowledge) mix-nets
Bulletin boards
Blockchain, esp. privacy in blockchain
Functional commitments, accumulators
Privacy-preserving data mining and machine learning
Computationally-private information retrieval, oblivious transfer
Theory of cryptography: definitions and underlying assumptions
Relations with coding theory
News
News
September 1, 2023. Helger Lipmaa leaves Simula UiB, and thus, this group no longer exists.
August 31, 2023. A paper by Helger Lipmaa, Roberto Parisella, Janno Siim ("Algebraic Group Model with Oblivious Sampling") was accepted to Asiacrypt 2023.
August 25, 2023. A paper by Helger Lipmaa ("On Black-Box Knowledge-Sound Commit-And-Prove SNARKs") was accepted to Asiacrypt 2023.
July 13, 2023. A paper by Helger Lipmaa and Roberto Parisella ("Set (Non-)Membership NIZKs from Determinantal Accumulators") was accepted to Latinscrypt 2023.
June 9, 2023. Roberto Parisella defended his Ph.D. thesis ("On a New, Efficient Framework for Falsifiable Non-interactive Zero-Knowledge Arguments"). See here for official information on the defense.
May 5, 2023. Roberto Parisella held a Ph.D. defense trial lecture on the topic "Kolmogorov complexity and cryptography"
May 1, 2023. A paper by Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, and Janno Siim ("Impossibilities in Succinct Arguments: Black-box Extraction and More) was accepted to Africacrypt 2023.
March 1, 2023. We have an open call for a Ph.D. student position! Please apply (Closed now!)
January 27, 2023. Roberto Parisella has a seminar on the foundations of the PAC learning.
December 6, 2022. Janno Siim gives Asiacrypt 2022 presentation on "Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK". [See Research Group Presentations for videos]
November 30, 2022. Janno Siim gives Simula UiB internal seminar on "Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK".
November 15-17, 2022. ZKProof Workshop in Tel Aviv has a presentation of the Asiacrypt 2022 paper (Lipmaa, Siim, Zajac, "Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK") by Michal Zajac. [See Research Group Presentations for videos]
November 4, 2022. Ph.D. Defense of Arne Tobias Ødegaard
October 28, 2022. Norwegian Cryptoseminar 2022 in Bergen, organized by Simula UiB. Includes a presentation by Roberto Parisella.
October 22, 2022. Bergen CBDC event organized by Simula UiB. Includes a presentation by Janno Siim.
October 10, 2022. The Ph.D. trial lecture of Arne Tobias Ødegaard on "Fully-Homomorphic Encryption".
September 2022. Helger Lipmaa visits IMDEA Software Institute in Madrid, being a Ph.D. reviewer of Anaïs Querol. Helger also presented our paper ""Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK").
September 2022. Roberto Parisella is attending SCN 2022, presenting his paper.
August 2022. A paper by Helger Lipmaa, Janno Siim, and Michał Zając ("Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK") was accepted to Asiacrypt 2022.
July 6, 2022. Roberto Parisella's gives Simula UiB internal seminar on "NIWI and New Notions of Extraction for Algebraic Languages".
June 2022. Roberto Parisella's paper ("NIWI and New Notions of Extraction for Algebraic Languages", Chaya Ganesh, Hamidreza Khoshakhlagh and Roberto Parisella) was accepted to SCN 2022
March 2022. We welcome Janno Siim, as a postdoc, to our team! Janno defended his Ph.D. in the University of Tartu under the supervision of Helger Lipmaa.
March 2022. Helger Lipmaa presented his paper "A Unified Framework for Non-universal SNARKs" at PKC 2022
Team
Team
Chief research scientist
Roberto Parisella
Roberto Parisella
Postdoctoral fellow
Alumni
Alumni
Prastudy Fauzi [google scholar profile dblp profile]
former postdoc; currently a research fellow at Nanyang Technological University, Singapore
Arne-Tobias Ødegaard [google scholar profile dblp profile]
former Ph.D. student; defended Ph.D. in November 2022.
Kateryna Pavlyk [google scholar profile dblp profile]
former postdoc; currently an associate professor at HVL.
Latest Papers
Latest Papers
This list contains only papers that acknowledge Simula UiB as an employer (in particular, it misses papers published before somebody joined or after somebody left Simula UiB). See the DBLP pages of individual researchers for the full list.
2023
2023
Helger Lipmaa and Roberto Parisella. Set (Non-)Membership NIZKs from Determinantal Accumulators. In Mehdi Tibouchi and Abdelrahaman Aly, editors, LATINCRYPT 2023, volume ? of Lecture Notes in Computer Science, pages ?--?, Quito, Ecuador, October 4--6, 2022. Springer, Cham. Accepted.
Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, and Janno Siim. Impossibilities in Succinct Arguments: Black-box Extraction and More. In Sylvain Duquesne, Luca De Feo, and Nadia El Mrabet, editors, AFRICACRYPT 2023, volume ? of Lecture Notes in Computer Science, pages ?--?, Sousse, Tunisia, July~19--21, 2023. Springer, Cham. Accepted.
2022
2022
Helger Lipmaa, Janno Siim and Michał Zając. Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. ASIACRYPT (2) 2022: 249-278
Helger Lipmaa: A Unified Framework for Non-universal SNARKs. Public Key Cryptography (1) 2022: 553-583
Chaya Ganesh, Hamidreza Khoshakhlagh and Roberto Parisella. NIWI and New Notions of Extraction for Algebraic Languages. SCN 2022: 687-710
2021
2021
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michał Zając: On Subversion-Resistant SNARKs. J. Cryptol. 34(3): 17 (2021)
Helger Lipmaa, Kateryna Pavlyk: Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG. ASIACRYPT (3) 2021: 34-64
Geoffroy Couteau, Helger Lipmaa, Roberto Parisella, Arne Tobias Ødegaard: Efficient NIZKs for Algebraic Sets. ASIACRYPT (3) 2021: 128-158
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michał Zając, Arne Tobias Ødegaard: Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge. ASIACRYPT (4) 2021: 618-649
Toomas Krips, Helger Lipmaa: More Efficient Shuffle Argument from Unique Factorization. CT-RSA 2021: 252-275
Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim: Somewhere Statistically Binding Commitment Schemes with Applications. Financial Cryptography (1) 2021: 436-456
Behzad Abdolmaleki, Hamidreza Khoshakhlagh, Helger Lipmaa: Smooth Zero-Knowledge Hash Functions. INDOCRYPT 2021: 510-535
Prastudy Fauzi, Martha Norberg Hovd, Håvard Raddum: A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem. PQCrypto 2021: 483-498
2020
2020
Helger Lipmaa, Kateryna Pavlyk: Succinct Functional Commitment for a Large Class of Arithmetic Circuits. ASIACRYPT (3) 2020: 686-716
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michał Zając: On QA-NIZK in the BPK Model. Public Key Cryptography (1) 2020: 590-620
Helger Lipmaa: Key-and-Argument-Updatable QA-NIZKs. SCN 2020: 645-669
Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panos Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michał Zając:
A Non-interactive Shuffle Argument with Low Trust Assumptions. CT-RSA 2020: 667-692
2019
2019
Prastudy Fauzi, Sarah Meiklejohn, Rebekah Mercer, Claudio Orlandi: Quisquis: A New Design for Anonymous Cryptocurrencies. ASIACRYPT (1) 2019: 649-678
Our Presentations
Our Presentations
To not overload this page, please check here.
Research visitors
Research visitors
2023
2023
Carla Ràfols
Daniel Slamanig
2022
2022
Dario Fiore
2021
2021
Janno Siim
2019 (pre-corona)
2019 (pre-corona)
Anca Nitulescu
Janno Siim
Luca De Feo
Work address
Work address
Simula UiB
Merkantilen (3rd floor)
Thormøhlens gate 53D
N-5006 Bergen
Norway
Google Sites
Report abuse