Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Simula UiB
PQC migration in practice
The future expects you to be PQC compliant Kristian Augusts gate 23 23 Kristian Augusts gate 0164 Sentrum Norway Good to know Highlights 6 hours, 30 minutes In person About this event Science & Tech • High Tech PQC migration in practice Many people are already aware that quantum computers are a threat to the cryptography we rely on for digital security.
Breakfast meeting on PQC migration in practice
Many people are already aware that quantum computers threaten the cryptography we rely on for digital security. We need to replace vulnerable cryptography with post-quantum alternatives, but where and how should you start this task in your own organisation? This one-hour breakfast meeting will provide you with a brief introduction to the problem of migrating to post-quantum cryptography (PQC) from a practical point of view.
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions
Paper 2024/173 , University of Tartu , Simula UiB , Simula UiB We prove that the seminal KZG polynomial commitment scheme (PCS) is black-box extractable under a simple falsifiable assumption ARSDH. To create an interactive argument, we construct a compiler that combines a black-box extractable non-interactive PCS and a polynomial IOP (PIOP). The compiler incurs a minor cost per every committed polynomial.
Dynamic Security Aspects of Onion Routing
Paper 2023/1439 , Simula UiB , Simula UiB , Simula UiB An anonymous communication network (ACN) is designed to protect the identities of two parties communicating through it, even if an adversary controls or observes parts of the network. Among the ACNs, Tor represents a practical trade-off between offering a reasonable level of anonymity and, simultaneously, an acceptable transmission delay.
SoK: Public Key Encryption with Openings
Paper 2023/1337 , Simula UiB , NTNU - Norwegian University of Science and Technology , Simula UiB When modelling how public key encryption can enable secure communication, we should acknowledge that secret information, such as private keys or the randomness used for encryption, could become compromised. Intuitively, one would expect unrelated communication to remain secure, yet formalizing this intuition has proven challenging.
Simulation-Extractable SNARKs Revisited
Paper 2019/612 Simulation-Extractable SNARKs Revisited , Simula UiB, Bergen, Norway Abstract The most efficient SNARKs (e.g., Groth, 2016) have a brittle and difficult-to-verify knowledge-soundness proof in the generic model, which makes it nontrivial to modify such SNARKs to, e.g., satisfy simulation-extractability or to implement some other language instead of QAP (Quadratic Arithmetic Program).
R&D: Finite Blocklength Performance Bound for DNA Storage Channel
Presenting finite blocklength performance bound for DNA storage channel with insertions, deletions, and substitutions This is a Press Release edited by StorageNewsletter.com on April 14, 2023 at 2:00 pm arxiv.org has published an article written by Issam Maarouf, Simula UiB, N-5006 Bergen, Norway, Gianluigi Liva, nstitute of Communications and Navigation, German Aerospace Center, 82234 Weßling, Germany, Eirik Rosnes, Simula UiB, N-5006 Bergen, Norway, and Alexandre Graell i Amat, Department...
R&D: Achievable Information Rates and Concatenated Codes for DNA Nanopore Sequencing Channel
Show that concatenated coding scheme with outer low-density parity-check code and inner convolutional code yields excellent performance. This is a Press Release edited by StorageNewsletter.com on April 7, 2023 at 2:00 pm arxiv.org has published an article written by Issam Maarouf, Eirik Rosnes, Simula UiB, N-5006 Bergen, Norway, and Alexandre Graell i Amat, Department of Electrical Engineering, Chalmers University of Technology, SE-41296 Gothenburg, Sweden.
Tools with general AI and no existential risk - AI and Ethics
Abstract According to philosophers and scientists in artificial intelligence (AI), future autonomous agents with general AI constitute an existential risk to humanity. This paper leverages results from neuroscience to propose tools with general AI and no existential risk. Tools answering questions in different domains enable the safe exploration of general AI’s enormous potential.
A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions
Paper 2023/176 A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions , Inria de Paris Research Centre, Sorbonne University (France) , Simula UiB (Norway) Abstract The Regular Syndrome Decoding (RSD) problem, a variant of the Syndrome Decoding problem with a particular error distribution, was introduced almost 20 years ago by Augot et al..
Set (Non-)Membership NIZKs from Determinantal Accumulators
Paper 2022/1570 Set (Non-)Membership NIZKs from Determinantal Accumulators , Simula UiB, Norway , Simula UiB, Norway Abstract We construct the most efficient (in the argument size and the verifier's computation) known falsifiable set (non-)membership NIZK $\Pi^*$, where the membership (resp., non-membership) argument consists of only $9$ (resp., $15$) group elements. It also has a universal CRS. $\Pi^*$ is based on the novel concept of determinantal accumulators.
Multi-Instance Secure Public-Key Encryption
Paper 2022/909 Multi-Instance Secure Public-Key Encryption , Simula UiB , Simula UiB , Simula UiB Abstract Mass surveillance targets many users at the same time with the goal of learning as much as possible. Intuitively, breaking many users’ cryptography simultaneously should be at least as hard as that of only breaking a single one, but ideally security degradation is gradual: an adversary ought to work harder to break more.
NIWI and New Notions of Extraction for Algebraic Languages
Paper 2022/851 NIWI and New Notions of Extraction for Algebraic Languages , Indian Institute of Science , Aarhus University , Simula UiB Abstract We give an efficient construction of a computational non-interactive witness indistinguishable (NIWI) proof in the plain model, and investigate notions of extraction for NIZKs for algebraic languages.
Tightness Subtleties for Multi-user PKE Notions
Paper 2022/855 Tightness Subtleties for Multi-user PKE Notions , Simula UiB , Simula UiB Abstract Public key encryption schemes are increasingly being studied concretely, with an emphasis on tight bounds even in a multi-user setting. Here, two types of formalization have emerged, one with a single challenge bit and one with multiple challenge bits. Another modelling choice is whether to allow key corruptions or not.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Simula
Contact Simula, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack