Home
Search results “Quantum public key cryptosystems” for the 2011
Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
 
19:12
Talk at crypto 2011. Authors: Taizo Shirai, Koichi Sakumoto, Harunaga Hiwatari. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23604
Views: 610 TheIACR
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
 
16:23
Talk at crypto 2011. Authors: Alexander Russell, Hang Dinh, Cristopher Moore. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23607
Views: 1912 TheIACR
Classical Cryptographic Protocols in a Quantum World
 
19:25
Talk at crypto 2011. Authors: Adam Smith, Sean Hallgren, Fang Song. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23587
Views: 436 TheIACR
Sending Secrets: Security and Cryptography in a Quantum World
 
01:09:40
Cris Moore, Professor, Santa Fe Institute April 13, 2011 Caesar shifted each letter three places in the alphabet. Much of modern computer science was born in the effort to break the Nazi Enigma code, and Cold War spies used code books that fit inside a walnut. Nowadays, the cryptography we depend on every day — for instance, to send our credit card information when we buy something on the Web — relies in turn on the mathematics of prime numbers. But in 1994, Peter Shor discovered that a future quantum computer could crack our cryptosystems by breaking large numbers into their prime factors. Cris will start by describing how these cryptosystems work, and how a quantum computer could break them. (Nothing beyond high-school math, he promises!) He'll end by giving a personal view about whether quantum computers can be built — and what kinds of cryptography could remain secure even if and when they are built.
Views: 5329 Santa Fe Institute
Bi-Deniable Public-Key Encryption
 
22:42
Talk at crypto 2011. Authors: Chris Peikert, Brent Waters, Adam O'Neill. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23594
Views: 842 TheIACR
Prime Numbers & Public Key Cryptography
 
02:58
A simple explanation of how prime numbers are used in Public Key Cryptography from ABC1 science program Catalyst
Views: 64436 Simon Pampena
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
 
18:27
Talk at crypto 2011. Authors: Mihir Bellare, Sriram Keelveedhi. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23599
Views: 438 TheIACR
Elliptic Curve and Quantum Cryptography - CompTIA Security+ SY0-301: 6.1
 
02:30
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Our modern privacy requires new methods of encrypting and protecting our data. In this video, you'll learn how the emerging technologies of elliptic curve and quantum cryptography are changing the face of encryption.
Views: 13951 Professor Messer
Understanding Hardware-based Encryption - CompTIA Security+ SY0-301: 4.3
 
06:36
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - We often use hardware to handle the resource-heavy encryption process. In this video, you'll learn about trusted platform modules, hardware security modules, USB encryption, and hardware-based hard drive encryption.
Views: 31365 Professor Messer
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem.
 
21:30
Talk at pkc 2010. Authors: Jean-Charles Faugère, Pierre-Jean Spaenlehauer. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23421
Views: 323 TheIACR
Chapter 9, part 4, Information Security: Principles and Practice
 
14:56
Chapter 9: Simple Authentication Protocols Sections 9.3.2-9.3.3 public key authentication, session key Class Lecture, 2011
Views: 4148 Mark Stamp
Physically Uncloneable Functions in the Universal Composition Framework
 
18:22
Christina Brzuska, Marc Fischlin, Heike Schröder, and Stefan Katzenbeisser Darmstadt University of Technology and Center for Advanced Security Research Darmstadt, Germany Abstract. Recently, there have been numerous works about hardware-assisted cryptographic protocols, either improving previous constructions in terms of efficiency, or in terms of security. In particular, many suggestions use Canetti's universal composition (UC) framework to model hardware tokens and to derive schemes with strong security guarantees in the UC framework. In this paper, we augment this approach by considering Physically Uncloneable Functions (PUFs) in the UC framework. Interestingly, when doing so, one encounters several peculiarities specific to PUFs, such as the intrinsic non-programmability of such functions. Using our UC notion of PUFs, we then devise efficient UC-secure protocols for basic tasks like oblivious transfer, commitments, and key exchange. It turns out that designing PUF-based protocols is fundamentally different than for other hardware tokens. For one part this is because of the non-programmability. But also, since the functional behavior is unpredictable even for the creator of the PUF, this causes an asymmetric situation in which only the party in possession of the PUF has full access to the secrets.
Views: 1447 TheIACR
Public Key Schemes - Stacey Jeffery - QCSYS 2011
 
08:00
IQC Masters student Stacey Jeffery lectures on the concepts and applications of public key schemes.
quick cryptography overview.avi
 
02:01
2 min description of cryptography mindmap video by GG.
Views: 90 Jgilready
Implementing Public and Private Keys - CompTIA Security+ SY0-301: 6.4
 
05:38
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - The generation of digital certificates is a staple of any PKI. In this video, you'll learn how to build a set of public and private keys in GPG.
Views: 10118 Professor Messer
PacSec 2011 Eric Filiol - Dynamic Cryptographic Backdoors to take over the TOR network. - New Audio
 
55:18
secwest - World Emerging Security Technology. Video from PacSec, November 2011, Tokyo, Eric Filiol outlines potential threats to the TOR anonymity network from compromised cryptographic functions. (Reminder: the CanSecWest 2012 Call for Papers closes next week. See http://cansecwest.com/speakers.html)
Views: 1399 Dragos Ruiu
DISI 2007: A Fool's Errand Inventing Public Key Cryptography.
 
01:08:10
PhD. Martin Hellman, Stanford University USA. Keynote speaker at DISI 2007, Information Security International Day, December 3th 2007. E.U. Telecommunications Engineering, Technical University of Madrid, Spain. UPM Applus+ Information Society Security and Development Chair. Slides of Mr. Hellman talk: http://www.criptored.upm.es/descarga/DISI07_MartinHellman.zip Video produced by Cabinet of Tele-Education GATE, Technical University of Madrid.
Views: 1306 UPM
Cryptography
 
02:08
Professor Dan Boneh is offering a free, online class on Cryptography starting January 2012. http://www.crypto-class.org/
Views: 21982 mlClassStaff
Public and Private Keys - CompTIA Security+ SY0-301: 6.3
 
04:13
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Asymmetric encryption technology has redefined our use of encryption with today's technology. In this video, you'll learn how this pair of keys allows use to encrypt, authenticate, manage non-repudiation, and validate our data.
Views: 13856 Professor Messer
Tutorial on Homomorphic Encryption (part 1)
 
42:38
Tutorial on homomorphic encryption by Shai Halevi, presented at Crypto 2011 in Santa Barbara, CA. Part 1 of 2. Presentation materials available at http://people.csail.mit.edu/shaih/presentations.html
Views: 12781 TheIACR
NOTACON 3: Encryption For Programmers
 
58:01
Speaker: Riscphree This talk will discuss encryption from a programmer's perspective. Topics will include a beginners rundown of terms and small introduction to cryptography, legalities concerning the development of cryptographic material, basic concepts and examples, and finally, ethics. Examples will include source code, but will not apply to one specific language as to ensure more understanding with all developers. Even if you are not a programmer, with the information presented in the beginning of the talk, you should find it enjoyable and understandable. For more information visit: http://bit.ly/NOTACON_2006_information To download the video visit: http://bit.ly/NOTACON_2006_videos
Views: 230 Christiaan008
Classical Cryptography - Stacey Jeffery - QCSYS 2011
 
57:19
IQC Maters student Stacey Jeffery lectures on the concepts and applications of classical cryptography.
Cryptographic Hash Functions - CompTIA Security+ SY0-301: 6.2
 
06:57
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Cryptographic hashes provide us with features such as authentication, integrity, confidentiality, and non-repudiation. In this video, you'll learn about some of the most popular hashing ciphers.
Views: 20794 Professor Messer
Cryptographic Concepts Part 1.mp4
 
13:43
Basic Cryptographic Concepts & Encrypting Algorithms - Part 1 1. DIT/09/C1/0002 -- Sharmila P 2. DIT/09/C1/0022 -- C.W. Hemachandra 3. DIT/09/C1/0036 -- A.S.R. Fernando 4. DIT/09/C1/0057 -- L.S.R.A. De Silva 5. DIT/09/C1/0106 -- P.T.C. Peiris 6. DIT/09/C1/0111 -- W.S.V.P.Perera Programming Language & Design Concepts -- Assignment 2011 Sri Lanka Institute of Information Technology
Views: 840 wsvperera
Symmetric vs. Asymmetric Encryption - CompTIA Security+ SY0-301: 6.1
 
04:20
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - The two most common encryption methods are symmetric and asymmetric encryption. In this video, you'll learn the differences and when you might to see these two methods employed to protect your data.
Views: 35436 Professor Messer
Key Escrow - CompTIA Security+ SY0-301: 6.3
 
02:48
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - In some organizations, a third-party may have be part of a key escrow process. In this video, you'll learn about the need for key escrow and how to implement it into your PKI process.
Views: 8559 Professor Messer
Asymmetric Encryption with PGP and GPG - CompTIA Security+ SY0-301: 6.2
 
12:37
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - One of the most popular asymmetric encryption applications of all time is Pretty Good Privacy, and the OpenPGP compliant Gnu Privacy Guard is a commonly used implementation. In this video, you'll learn about both
Views: 19655 Professor Messer
Authentication - Stacey Jeffery - QCSYS 2011
 
25:12
IQC Masters student Stacey Jeffery lectures on the concepts and importance of authentication in crypto systems.
Make Your Own Encryption Program
 
03:51
📖📕 GET THE NEW TINKERNUT BOOK: http://bit.ly/Tinkernutbook 📕📖 This video lays out the steps for creating a very simple encryption and decryption program using free tools. The programming language we will be using is VB Script. See if you can decrypt this text: wkjlue#vnrro#huxwxi#uxr\ You can find all the code for this program as well as an alternative for Apple computers at the project page: http://www.tinkernut.com/archives/4193
Views: 103184 Tinkernut
Implementing Certificate Authorities - CompTIA Security+ SY0-301: 6.4
 
03:16
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Implementing a certificate authority can include both commercial and private certificate authorities. In this video, you'll learn the differences and similarities between a commercial and private CA.
Views: 10099 Professor Messer
Certificate Authorities - CompTIA Security+ SY0-301: 6.3
 
05:37
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - We rely on Certificate Authorities to provide a key component of our Public Key Infrastructures. In this video, you'll learn the role of the CA and policies that build additional trust in your certificates.
Views: 15165 Professor Messer
Key Escrow - CompTIA Security+ SY0-301: 6.1
 
02:49
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Certain security environments may require the escrow of cryptographic keys. In this video, you'll learn about key escrow and how the key escrow process can be implemented.
Views: 13272 Professor Messer
Key Registration - CompTIA Security+ SY0-301: 6.3
 
02:24
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - A certificate is only as good as the trust associated with it. In this video, you'll learn about key registration and the process that providers use to confirm the identify of certificate owners.
Views: 8418 Professor Messer
Implementing Key Revocation - CompTIA Security+ SY0-301: 6.4
 
02:19
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - The implementation of a key revocation process may vary depending on your PKI. In this video, you'll learn how to use CRLs and the process for revoking a key used in a web-of-trust environment.
Views: 8132 Professor Messer
Panel discussion on leakage
 
02:03
Crypto 2011 Rump session presentation for Ian Goldberg, Kevin McCurley, and Moti Yung, talk given by Daniel J. Bernstein (panel moderator)
Views: 1013 TheIACR
Understanding Single-Factor Authentication - CompTIA Security+ SY0-301: 5.2
 
04:38
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Authentication factors are many and varied, and the most common authentications usually involve a single factor. In this video, you'll learn about authentication factor types and how single factor provides advantages and disadvantages to the authentication process.
Views: 11697 Professor Messer
Lab Matters - Anatomy of the RSA targeted attack
 
09:46
Another edition of "Lab Matters" with a special guest Uri Rivner, Head of New Technologies, Identity Protection and Verification, RSA Security, where he describes what happened when RSA was hacked with a zero-day vulnerability.
Views: 2888 Securelist
Keeping Secrets: A Short on Cryptography
 
01:31
Project S.T.E.P. (Science and Technology Enhancement Program) is a National Science Foundation funded GK-12 grant at the University of Cincinnati. This video was created for a middle and/or high school audience to showcase STEM content by Mike Borowczak, a graduate student that works for the grant
Views: 2224 ProjectSTEPUC
Cryptographic Concepts Part 3.mp4
 
12:41
Basic Cryptographic Concepts & Encrypting Algorithms - Part 3 1. DIT/09/C1/0002 -- Sharmila P 2. DIT/09/C1/0022 -- C.W. Hemachandra 3. DIT/09/C1/0036 -- A.S.R. Fernando 4. DIT/09/C1/0057 -- L.S.R.A. De Silva 5. DIT/09/C1/0106 -- P.T.C. Peiris 6. DIT/09/C1/0111 -- W.S.V.P.Perera Programming Language & Design Concepts -- Assignment 2011 Sri Lanka Institute of Information Technology
Views: 150 wsvperera
Privileges - CompTIA Security+ SY0-301: 5.3
 
04:50
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - There are many ways to manage rights and permissions on the network. In this video, you'll learn how to use user management, group management, and role-based management types to control privileges to resources.
Views: 10152 Professor Messer
Chapter 2, part 4: Crypto Basics --- VENONA, codebook cipher, Zimmerman telegram
 
14:59
Information Security: Principles and Practice, 2nd edition, by Mark Stamp Chapter 2: Crypto Basics Sections 2.3.6-2.3.7 VENONA, codebook cipher, Zimmerman telegram Class Lecture, 2011
Views: 8222 Mark Stamp
Leftover Hash Lemma, Revisited (Crypto 2011)
 
22:10
Talk at Crypto 2011, August 15, 2011. Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, and Yu Yu Microsoft Research New England; New York University; IBM Research; Université Catholique de Louvain; CWI Amsterdam; Université Catholique de Louvain;and East China Normal University Abstract. The famous Leftover Hash Lemma (LHL) states that (almost) universal hash functions are good randomness extractors. Despite its numerous applications, LHL-based extractors suffer from the following two drawbacks: Large Entropy Loss: to extract $v$ bits from distribution $X$ of min-entropy $m$ which are $\epsilon$-close to uniform, one must set $v \le m - 2*\log(1/\epsilon)$, meaning that the entropy loss $L = m-v \ge 2*\log(1/\epsilon)$. Large Seed Length: the seed length $n$ of (almost) universal hash function required by the LHL must be at least $n \ge \min(u-v, v + 2*\log(1/\epsilon))-O(1)$, where $u$ is the length of the source. Quite surprisingly, we show that both limitations of the LHL — large entropy loss and large seed — can often be overcome (or, at least, mitigated) in various quite general scenarios. First, we show that entropy loss could be reduced to $L = \log (1/\epsilon)$ for the setting of deriving secret keys for a wide range of cryptographic applications. Specifically, the security of these schemes with an LHL-derived key gracefully degrades from $\epsilon$ to at most $\epsilon+\sqrt{\epsilon 2^{-L}}$. (Notice that, unlike standard LHL, this bound is meaningful even when one extracts more bits than the min-entropy we have!) Based on these results we build a general computational extractor that enjoys low entropy loss and can be used to instantiate a generic key derivation function for any cryptographic application. Second, we study the soundness of the natural expand-then-extract approach, where one uses a pseudorandom generator (PRG) to expand a short "input seed" $S$ into a longer "output seed" $S'$, and then use the resulting $S'$ as the seed required by the LHL (or, more generally, by any randomness extractor). We show that, in general, the expand-then extract approach is not sound if the Decisional Diffie-Hellman assumption is true. Despite that, we show that it is sound either: (1) when extracting a "small" (logarithmic in the security of the PRG) number of bits; or (2) in minicrypt. Implication (2) suggests that the expand-then-extract approach is likely secure when used with "practical" PRGs, despite lacking a reductionist proof of security! See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23565
Views: 1738 TheIACR
Elliptic Curve Cryptography Video 2
 
08:18
Advance Cyber Security. Finding the coordinates of P_1+P_2 Point addition. Based on a Cubic curve with one real component
Views: 11727 Israel Reyes
Implementing Digital Certificates - CompTIA Security+ SY0-301: 6.4
 
02:57
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - The implementation of digital certificates can vary depending on the environment, but the overall process is relatively similar. In this video, you'll see how Microsoft Certificate Services can be used to manage a PKI implementation.
Views: 8593 Professor Messer
Cryptography with Tamperable and Leaky Memory (Crypto 2011)
 
20:36
Yael Tauman Kalai, Bhavana Kanukurthi, and Amit Sahai Microsoft Research; Boston University; and University of California (UCLA) Abstract. A large and growing body of research has sought to secure cryptographic systems against physical attacks. Motivated by a large variety of real-world physical attacks on memory, an important line of work was initiated by Akavia, Goldwasser, and Vaikuntanathan [AGV09] where security is sought under the assumptions that: (1) all memory is leaky, and (2) leakage can be an arbitrarily chosen (efficient) function of the memory. However, physical attacks on memory are not limited to leakage through side-channels, but can also include active tampering attacks through a variety of physical attacks, including heat and EM radiation. Nevertheless, protection against the analogous model for tampering — where (1) all memory is tamperable, and (2) where the tampering can be an arbitrarily chosen (efficient) function applied to the memory — has remained an elusive target, despite significant effort on tampering-related questions. In this work, we tackle this question by considering a model where we assume that both of these pairs of statements are true — that all memory is both leaky and (arbitrarily) tamperable. Furthermore, we assume that this leakage and tampering can happen repeatedly and continually (extending the model of [DHLW, BKKV10] in the context of leakage). We construct a signature scheme and an encryption scheme that are provably secure against such attacks, assuming that memory can be updated in a randomized fashion between episodes of tampering and leakage. In both schemes we rely on the linear assumption over bilinear groups. We also separately consider a model where only continual and repeated tampering (but only bounded leakage) is allowed, and we are able to obtain positive results assuming only that "self-destruct" is possible, without the need for memory updates. Our results also improve previous results in the continual leakage regime without tampering [DHLW, BKKV10]. Whereas previous schemes secure against continual leakage (of arbitrary bounded functions of the secret key), could tolerate only 1/2-ε leakage-rate between key updates under the linear assumption over bilinear groups, our schemes can tolerate 1-ε leakage-rate between key updates, under the same assumption.
Views: 495 TheIACR
Associative Law Elliptic Curve Cryptography
 
04:24
(P1+P2)+P3=P1+(P2+P3)
Views: 3046 Israel Reyes
Cryptography Overview - CompTIA Security+ SY0-301: 6.1
 
08:35
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - The topic of cryptography is one of the most comprehensive in network security. In this video, you'll learn about the history of cryptography and some of the early methods of encrypting and decrypting messages.
Views: 27040 Professor Messer
Block and Stream Ciphers - CompTIA Security+ SY0-301: 6.1
 
03:15
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - Symmetric encryption often uses block ciphers or stream ciphers to create ciphertext. In this video, you'll learn how block and stream ciphers work and what methods these ciphers employ to keep your information private.
Views: 34229 Professor Messer
Mitigating Multiple Account Issues - CompTIA Security+ SY0-301: 5.3
 
03:54
See our entire index of CompTIA Security+ videos at http://www.FreeSecurityPlus.com - We are constantly faced with security concerns associated with the massive number of accounts that we have to manage professionally and personally. In this video, you'll learn about managing identities across multiple sites and how you can mitigate the issues that arise from an individual owning so many different accounts.
Views: 10085 Professor Messer