# Provable security A cryptographic security methodology that rigorously defines security and proves reductions to stated computational assumptions. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Shipping an L1 zkEVM #2: The Security Foundations DevFeed: [Shipping an L1 zkEVM #2: The Security Foundations]() Original publisher: [Read original article]() Author: George Kadianakis Published: 2025-12-18T00:00:00Z Content type: article Language: en Sources: [Ethereum Foundation Blog]() Topics: [Security](), [Cryptography](), [Provable security](), [Ethereum](), [P2P](), [Tool]() Tags: [cryptography](), [ethereum](), [p2p](), [provable-security](), [research](), [research-development](), [security](), [tool]() ### AI overview The Ethereum Foundation outlines security foundations for building a mainnet-grade L1 zkEVM after major improvements in real-time proving. It argues for provable security at a 128-bit target, describes the tension between security and proof size, and introduces soundcalc for consistent zkVM security assessments. ### Source excerpt Thanks to Arantxa Zapico, Benedikt Wagner, and Dmitry Khovratovich from the EF cryptography team for their contributions, and to Ladislaus, Kev, Alex, and Marius for the careful review and feedback. The zkEVM ecosystem has been sprinting for a year. And it worked! We crossed the finish line for real-time... ## Encrypting Arbitrary Data with Elliptic Curve ElGamal DevFeed: [Encrypting Arbitrary Data with Elliptic Curve ElGamal]() Original publisher: [Read original article]() Author: andreacorbellini Published: 2023-01-02T06:30:00Z Content type: tutorial Language: en Sources: [Andrea Corbellini]() Topics: [Cryptography](), [Encryption](), [private key](), [public key](), [Provable security]() Tags: [cryptography](), [ecc](), [elgamal](), [encryption]() ### AI overview This tutorial explains that elliptic curve keys can encrypt arbitrary data directly and introduces elliptic curve ElGamal as an example. It also notes that pure elliptic curve encryption is not widely used or standardized because key agreement is more convenient for most applications. ### Source excerpt From time to time, I hear people saying that Elliptic Curve Cryptography (ECC) cannot be used to directly encrypt data, and you can only do key agreement and digital signatures with it. This is a common misconception, but it's not actually true: you can indeed use elliptic curve keys to encrypt arbitrary data. And I'm not talking about hybrid-encryption schemes (like ECIES ... ## Galileo's Proposed Authentication Algorithm: Part 1 DevFeed: [Galileo's Proposed Authentication Algorithm: Part 1]() Original publisher: [Read original article]() Published: 2020-08-13T18:50:09Z Content type: article Language: en Sources: [Bert Hubert's writings]() Topics: [Cryptography](), [Security, Privacy and Abuse Prevention](), [integrity](), [Provable security](), [Network]() Tags: [cryptography](), [gnss](), [receiver](), [rf](), [series](), [spoofing]() ### AI overview This first part of a series explains Galileo's proposed Open Service Navigation Message Authentication (OSNMA), focusing on the TESLA cryptographic scheme and its role in improving trust in GNSS messages. It notes that message authentication cannot by itself prevent sophisticated RF spoofing, but is an important step toward detecting unauthenticated or altered data. ### Source excerpt Position, velocity and time (PVT) information can be a 'nice to have', but in other circumstances knowing place and time has legal or military importance as well. Heavy vehicles for example are typically outfitted with tachographs that track driver speed and/or location. This has importance for rest regulations, but also to check if loads are actually from where they say they are. Our Global Navigation Satellite Systems so far are broadcasting unauthenticated data, at least to civilian users. ## Doing the FizzleFade effect using a Feistel network DevFeed: [Doing the FizzleFade effect using a Feistel network]() Original publisher: [Read original article]() Published: 2017-08-29T14:35:14Z Content type: article Language: en Sources: [Antirez]() Topics: [Code](), [Provable security](), [GPU](), [3D]() Tags: [article](), [code](), [cryptography](), [gpu]() ### AI overview The article discusses reproducing Wolfenstein 3D's fizzlefade effect and proposes using a Feistel network instead of a Linear Feedback Shift Register. It explains that a Feistel network provides an invertible transformation that can produce the same pixel-ordering result across resolutions. ### Source excerpt Today I read an interesting article about how the Wolfenstein 3D game implemented a fade effect using a Linear Feedback Shift Register. Every pixel of the screen is set red in a pseudo random way, till all the screen turns red (or other colors depending on the event happening in the game). The blog post describing the implementation is here and is a nice read: http://fabiensanglard.net/fizzlefade/index.php You may wonder why the original code used a LFSR or why I'm proposing a different approach, instead of the vanilla setPixel(rand(),rand()): doing this with a pseudo random generator, as noted in the blog post, is slow, but is also visually very unpleasant, since the more red pixels you have on the screen already, the less likely is that you hit a new yet-not-red pixel, so the final pixels take forever to turn red (I *bet* that many readers of this blog post tried it in the old times of the Spectum, C64, or later with QBASIC or GWBasic). In the final part of the blog post the author writes: "Because the effect works by plotting pixels individually, it was hard to replicate when developers tried to port the game to hardware accelerated GPU. None of the ports managed to replicate the fizzlefade except Wolf4SDL, which found a LFSR taps configuration to reach resolution higher than 320x200." While not rocket science, it was possibly hard for other resolutions to find a suitable LFSR. However regardless of the real complexity of finding an appropriate LFSR for other resolutions, the authors of the port could use another technique, called a Feistel Network, to get exactly the same result in a trivial way. What is a Feistel Network? === It's a building block typically used in cryptography: it creates a transformation between a sequence of bits and another sequence of bits, so that the transformation is always invertible, even if you use all the kind of non linear transformations inside the Feistel network. In practical terms the Feistel network can, for example, translate ## Threat Modeling Encrypted Databases DevFeed: [Threat Modeling Encrypted Databases]() Original publisher: [Read original article]() Author: Adam Published: 2017-07-06T00:00:00Z Content type: opinion Language: en Sources: [Shostack & Friends Blog]() Topics: [Databases](), [Encryption](), [Provable security](), [Security]() Tags: [crypto](), [databases](), [paper](), [provable-security](), [security]() ### AI overview This article summarizes a paper arguing that encrypted databases may not provide the security claimed against snapshot attackers. It explains that theoretical models may not capture the information revealed by compromised database systems or how attackers can infer plaintext data. ### Source excerpt [no description provided]