MastodonTech.de

Technische Universität MünchenResearchers, including Jens Ernstberger and Sebastian Steinhorst, developed a method to cryptographically prove location without revealing it, using <a href="https://wisskomm.social/tags/ZeroKnowledgeProofs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZeroKnowledgeProofs</a> with standardized floating-point numbers: <a href="http://go.tum.de/784017" rel="nofollow noopener" translate="no" target="_blank">http://go.tum.de/784017</a><a href="https://wisskomm.social/tags/IoT" class="mention hashtag" rel="nofollow noopener" target="_blank">#IoT</a> <a href="https://wisskomm.social/tags/EmbeddedSystems" class="mention hashtag" rel="nofollow noopener" target="_blank">#EmbeddedSystems</a> <a href="https://wisskomm.social/tags/DataProtection" class="mention hashtag" rel="nofollow noopener" target="_blank">#DataProtection</a> 📷A.Heddergott

Hacker NewsZero-knowledge proofs, encoding Sudoku and Mario speedruns without semantic leak<a href="https://vasekrozhon.wordpress.com/2025/03/17/zero-knowledge-proofs/" rel="nofollow noopener" translate="no" target="_blank">https://vasekrozhon.wordpress.com/2025/03/17/zero-knowledge-proofs/</a><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener" target="_blank">#HackerNews</a> <a href="https://mastodon.social/tags/ZeroKnowledgeProofs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZeroKnowledgeProofs</a> <a href="https://mastodon.social/tags/EncodingSudoku" class="mention hashtag" rel="nofollow noopener" target="_blank">#EncodingSudoku</a> <a href="https://mastodon.social/tags/MarioSpeedruns" class="mention hashtag" rel="nofollow noopener" target="_blank">#MarioSpeedruns</a> <a href="https://mastodon.social/tags/SemanticLeak" class="mention hashtag" rel="nofollow noopener" target="_blank">#SemanticLeak</a>

Frederic Jacobs> We present LatticeFold+, a very different lattice-based folding protocol that improves on LatticeFold in every respect: the prover is five to ten times faster, the verification circuit is simpler, and the folding proofs are shorter<a href="https://eprint.iacr.org/2025/247" rel="nofollow noopener" translate="no" target="_blank">https://eprint.iacr.org/2025/247</a> <a href="https://mastodon.social/tags/PQC" class="mention hashtag" rel="nofollow noopener" target="_blank">#PQC</a> <a href="https://mastodon.social/tags/ZeroKnowledgeProofs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZeroKnowledgeProofs</a> <a href="https://mastodon.social/tags/ZKPs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZKPs</a> <a href="https://mastodon.social/tags/Cryptography" class="mention hashtag" rel="nofollow noopener" target="_blank">#Cryptography</a>

InfoQEver heard of <a href="https://techhub.social/tags/ZeroKnowledgeProofs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZeroKnowledgeProofs</a>?Zero-knowledge proofs are a kind of <a href="https://techhub.social/tags/cryptography" class="mention hashtag" rel="nofollow noopener" target="_blank">#cryptography</a> used to provide proof of a secret, such as a private key or the solution to a problem, without sharing it with interested parties.<a href="https://techhub.social/tags/InfoQ" class="mention hashtag" rel="nofollow noopener" target="_blank">#InfoQ</a> article by: <a href="https://bit.ly/3x7P1hn" rel="nofollow noopener" translate="no" target="_blank">https://bit.ly/3x7P1hn</a><a href="https://techhub.social/tags/Blockchain" class="mention hashtag" rel="nofollow noopener" target="_blank">#Blockchain</a> <a href="https://techhub.social/tags/Security" class="mention hashtag" rel="nofollow noopener" target="_blank">#Security</a> <a href="https://techhub.social/tags/DataPrivacy" class="mention hashtag" rel="nofollow noopener" target="_blank">#DataPrivacy</a> <a href="https://techhub.social/tags/Database" class="mention hashtag" rel="nofollow noopener" target="_blank">#Database</a> <a href="https://techhub.social/tags/SoftwareDevelopment" class="mention hashtag" rel="nofollow noopener" target="_blank">#SoftwareDevelopment</a>

Frederic JacobsRecursive SNARKs go post-quantum: “we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK.”LatticeFold supports low-degree relations (R1CS) as well as high-degree relations (CCS) and is considered as performant as Hypernova but with post-quantum security.<a href="https://eprint.iacr.org/2024/257" rel="nofollow noopener" translate="no" target="_blank">https://eprint.iacr.org/2024/257</a><a href="https://mastodon.social/tags/PQC" class="mention hashtag" rel="nofollow noopener" target="_blank">#PQC</a> <a href="https://mastodon.social/tags/ZeroKnowledgeProofs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZeroKnowledgeProofs</a> <a href="https://mastodon.social/tags/ZKPs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ZKPs</a> <a href="https://mastodon.social/tags/Cryptography" class="mention hashtag" rel="nofollow noopener" target="_blank">#Cryptography</a>

Frühere Suchanfragen

Suchoptionen

Verwaltet von:

Serverstatistik:

#zeroknowledgeproofs