Coding theory | Information theory | Error detection and correction | Finite fields
Network coding has been shown to optimally use bandwidth in a network, maximizing information flow but the scheme is very inherently vulnerable to pollution attacks by malicious nodes in the network. A node injecting garbage can quickly affect many receivers. The pollution of network packets spreads quickly since the output of (even an) honest node is corrupted if at least one of the incoming packets is corrupted. An attacker can easily corrupt a packet even if it is encrypted by either forging the signature or by producing a collision under the hash function. This will give an attacker access to the packets and the ability to corrupt them. Denis Charles, Kamal Jain and Kristin Lauter designed a new homomorphic encryption signature scheme for use with network coding to prevent pollution attacks. The homomorphic property of the signatures allows nodes to sign any linear combination of the incoming packets without contacting the signing authority. In this scheme it is computationally infeasible for a node to sign a linear combination of the packets without disclosing what linear combination was used in the generation of the packet. Furthermore, we can prove that the signature scheme is secure under well known cryptographic assumptions of the hardness of the discrete logarithm problem and the computational Elliptic curve Diffie–Hellman. (Wikipedia).
Homomorphisms in abstract algebra
In this video we add some more definition to our toolbox before we go any further in our study into group theory and abstract algebra. The definition at hand is the homomorphism. A homomorphism is a function that maps the elements for one group to another whilst maintaining their structu
From playlist Abstract algebra
Homomorphisms in abstract algebra examples
Yesterday we took a look at the definition of a homomorphism. In today's lecture I want to show you a couple of example of homomorphisms. One example gives us a group, but I take the time to prove that it is a group just to remind ourselves of the properties of a group. In this video th
From playlist Abstract algebra
Group Homomorphisms - Abstract Algebra
A group homomorphism is a function between two groups that identifies similarities between them. This essential tool in abstract algebra lets you find two groups which are identical (but may not appear to be), only similar, or completely different from one another. Homomorphisms will be
From playlist Abstract Algebra
Homophily Solution - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Ring Homomorphisms: Φ(u^-1)=Φ(u)^-1 Proof (Abstract Algebra)
Ring Homomorphisms have lots of great properties. Here's a look at one of them. If you want more abstract algebra videos, let me know in the comments! Some of the links below are affiliate links. As an Amazon Associate I earn from qualifying purchases. If you purchase through these links,
From playlist Abstract Algebra
What is a Group Homomorphism? Definition and Example (Abstract Algebra)
Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys What is a Group Homomorphism? Definition and Example (Abstract Algebra)
From playlist Abstract Algebra
Ring Theory: We define ring homomorphisms, ring isomorphisms, and kernels. These will be used to draw an analogue to the connections in group theory between group homomorphisms, normal subgroups, and quotient groups.
From playlist Abstract Algebra
Payment Channels by Sushmita Ruj
DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.
From playlist Foundational Aspects of Blockchain Technology 2020
2022 I E Block Community Lecture: AI and Cryptography
July 13, 2022 How is Artificial Intelligence (AI) changing your life and the world? How can you expect your data to be kept secure and private in an AI-driven future? Kristin Lauter of Meta AI Research gives the I. E. Block Community Lecture titled "Artificial Intelligence and Cryptograph
From playlist SIAM Conference Videos
Surjective homomorphisms in abstract algebra
We have looked at homomorphisms before: https://www.youtube.com/watch?v=uTIvIFmVEAg&list=PLsu0TcgLDUiI2VH4ubaKNLxp8O5DN9pF3&index=33 https://www.youtube.com/watch?v=NuYczPkUZGY&list=PLsu0TcgLDUiI2VH4ubaKNLxp8O5DN9pF3&index=34 https://www.youtube.com/watch?v=3Oo0O1vVPoQ&list=PLsu0TcgLDUiI2V
From playlist Abstract algebra
Isomorphisms in abstract algebra
In this video I take a look at an example of a homomorphism that is both onto and one-to-one, i.e both surjective and injection, which makes it a bijection. Such a homomorphism is termed an isomorphism. Through the example, I review the construction of Cayley's tables for integers mod 4
From playlist Abstract algebra
MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018 Instructor: Tadge Dryja View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61KHzhg3JIJdK08JLSlcLId Hiding output amounts, commitments, Pedersen commitmen
From playlist MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018
Privacy-preserving Information Sharing: Tools and Applications: Dr Emiliano De Cristofaro
Short Bio: I am a Reader (Associate Professor) in Security and Privacy Enhancing Technologies at University College London (UCL), where I am affiliated with the Computer Science Department and the Information Security Group. Before joining UCL in 2013, I was a research scientist at Xerox
From playlist Turing Seminars
zkSNARKs -- Recent progress and applications to blockchain protocols by Chaya Ganesh
DISCUSSION MEETING : FOUNDATIONAL ASPECTS OF BLOCKCHAIN TECHNOLOGY ORGANIZERS : Pandu Rangan Chandrasekaran DATE : 15 to 17 January 2020 VENUE : Madhava Lecture Hall, ICTS, Bangalore Blockchain technology is among one of the most influential disruptive technologies of the current decade.
From playlist Foundational Aspects of Blockchain Technology 2020
Mathematical Ideas in Lattice Based Cryptography - Jill Pipher
2018 Program for Women and Mathematics Topic: Mathematical Ideas in Lattice Based Cryptography Speaker: Jill Pipher Affiliation: Brown University Date: May 21, 2018 For more videos, please visit http://video.ias.edu
From playlist Mathematics
Stanford Seminar - Evolution of a Web3 Company
This talk was given the week of October 3, 2022. Guest speaker: Sam Green, Co-Founder & Head of Research at Semiotic Labs. #web3
RustConf 2018 - Integrating Rust into Tor... by Isis Lovecruft & Chelsea Komlo
RustConf 2018 - Integrating Rust into Tor: Successes and Challenges by Isis Lovecruft & Chelsea Komlo In 2016, The Tor Project's network team decided to experiment with writing existing and new functionality in Rust. Since then, this experiment has turned into a team initiative, with mult
From playlist RustConf 2018
Shmuel Weinberger - Some introductory remarks on the Novikov conjecture
I will explain a few simple ideas about the Novikov conjecture and related problems Shmuel Weinberger (University of CHICAGO)
From playlist Not Only Scalar Curvature Seminar
Graph Theory FAQs: 04. Isomorphism vs Homomorphism
In this video we recall the definition of a graph isomorphism and then give the definition of a graph homomorphism. Then we look at two examples of graph homomorphisms and discuss a special case that relates to graph colourings. -- Graph Theory FAQs by Dr. Sarada Herke. Related videos:
From playlist Graph Theory FAQs
A Complete Dichotomy Rises from the Capture of Vanishing Signatures - Jin-Yi Cai
Jin-Yi Cai University of Wisconsin November 19, 2012 Holant Problems are a broad framework to describe counting problems. The framework generalizes counting Constraint Satisfaction Problems and partition functions of Graph Homomorphisms. We prove a complexity dichotomy theorem for Holant
From playlist Mathematics