Search results “Johannes buchmann introduction to cryptography and network”
Johannes Buchmann - Cryptography Based Security Solutions
The chairman of CROSSING - Cryptography Based Security Solutions - Technische Universitat Darmstadt, Johannes Buchmann describes the collaborative work at the centre. The research covers the whole field of cybersecurity to study the foundations through to the applications that will be resistant to the attacks they forsee. Buchmann was visiting IQC for PQCrypto 2014, the 6th international conference on post-quantum cryptography (https://pqcrypto2014.uwaterloo.ca/). Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Johannes Buchmann - Challenges and opportunities of cryptography
Johannes Buchmann, the chairman of CROSSING - Cryptography Based Security Solutions - Technische Universitat Darmstadt, summarizes the challenges of cryptography. However, we'll now be in a position to achieve the protection goals that are required. Buchmann was visiting IQC for PQCrypto 2014, the 6th international conference on post-quantum cryptography (https://pqcrypto2014.uwaterloo.ca/). Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Johannes Buchmann & Andreas Hulsing - Hash-Based Signatures
Johannes Buchmann of TU Darmstadt and Andreas Husling of the University of Technology, Eindhoven presented an invited talk on hash-based signatures at the 2014 PQCrypto summer school in October, 2014. PQCrypto Summer School: https://pqcrypto2014.uwaterloo.ca/summer-school/ Find out more about IQC! Website - https://uwaterloo.ca/institute-for-qu... Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
Talk at crypto 2011. Authors: Taizo Shirai, Koichi Sakumoto, Harunaga Hiwatari. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23604
Views: 614 TheIACR
Introduction to the Post-Quantum Supersingular Isogeny Diffie-Hellman Protocol
A talk given at the University of Waterloo on July 12th, 2016. The intended audience was mathematics students without necessarily any prior background in cryptography or elliptic curves. Apologies for the poor audio quality. Use subtitles if you can't hear.
Views: 2440 David Urbanik
Quantum Optics – Quantum cryptography the BB84 QKD scheme
One-photon based quantum technologies In this lesson, you will discover two quantum technologies based on one photon sources. Quantum technologies allow one to achieve a goal in a way qualitatively different from a classical technology aiming at the same goal. For instance, quantum cryptography is immune to progress in computers power, while many classical cryptography methods can in principle be broken when we have more powerful computers. Similarly, quantum random number generators yield true random numbers, while classical random number generators only produce pseudo-random numbers, which might be guessed by somebody else than the user. This lesson is also an opportunity to learn two important concepts in quantum information: (i) qubits based on photon polarization; (ii) the celebrated no-cloning theorem, at the root of the security of quantum cryptography. Learning Objectives • Apply your knowledge about the behavior of a single photon on a beam splitter to quantum random number generators. • Understand the no-cloning theorem • Understand and remember the properties of q qubit This course gives you access to basic tools and concepts to understand research articles and books on modern quantum optics. You will learn about quantization of light, formalism to describe quantum states of light without any classical analogue, and observables allowing one to demonstrate typical quantum properties of these states. These tools will be applied to the emblematic case of a one-photon wave packet, which behaves both as a particle and a wave. Wave-particle duality is a great quantum mystery in the words of Richard Feynman. You will be able to fully appreciate real experiments demonstrating wave-particle duality for a single photon, and applications to quantum technologies based on single photon sources, which are now commercially available. The tools presented in this course will be widely used in our second quantum optics course, which will present more advanced topics such as entanglement, interaction of quantized light with matter, squeezed light, etc... So if you have a good knowledge in basic quantum mechanics and classical electromagnetism, but always wanted to know: • how to go from classical electromagnetism to quantized radiation, • how the concept of photon emerges, • how a unified formalism is able to describe apparently contradictory behaviors observed in quantum optics labs, • how creative physicists and engineers have invented totally new technologies based on quantum properties of light, then this course is for you. Subscribe at: https://www.coursera.org
Views: 6280 intrigano
Introduction to Lattice Based Cryptography
This short video introduces the concept of a lattice, why they are being considered as the basis for the next generation of public key cryptography, and a short walkthrough of a specific encryption algorithm. For a very thorough paper designed to be readable for undergraduates I highly recommend https://eprint.iacr.org/2015/938.pdf. *One technical note: At 1:30 I claim that lattices are composed only of integers. This is not true. Some lattices only contain integers, but in general, any rational number will do.
Views: 8562 Matthew Dozer
Prof. Artur Ekert: Quantum Cryptography - the ultimate physical limits of privacy
Among those who make a living from the science of secrecy, worry and paranoia are just signs of professionalism. Can we protect our secrets against those who wield superior technological powers? Can we trust those who provide us with tools for protection? Can we even trust ourselves, our own freedom of choice? Recent developments in quantum cryptography show that some of these questions can be addressed and discussed in precise and operational terms, suggesting that privacy is indeed possible under surprisingly weak assumptions. Artur Ekert is a Professor of Quantum Physics at the Mathematical Institute, University of Oxford, and a Lee Kong Chian Centennial Professor at the National University of Singapore and also the Director of CQT (Centre for Quantum Technologies). His research interests span most aspects of information processing in quantum-mechanical systems, with a focus on quantum communication and quantum computation. He is best known as one of the inventors of quantum cryptography. --------- CUPS - Cambridge University Physics Society We are a student-run university society organising scientific talks and other events for our members and public. CUPS is all about the physics you don't do in your degree. FIND US ON THE INTERNET: Website - http://www.camphysoc.co.uk Facebook - http://www.facebook.com/camphysoc Twitter - http://www.twitter.com/camphysoc talks.cam - http://talks.cam.ac.uk/show/index/6558
Post-quantum cryptography from supersingular isogeny problems?
We review existing cryptographic schemes based on the hardness of computing isogenies between supersingular isogenies, and present some attacks against them. In particular, we present new techniques to accelerate the resolution of isogeny problems when the action of the isogeny on a large torsion subgroup is known, and we discuss the impact of these techniques on the supersingular key exchange protocol of Jao-de Feo.  See more on this video at https://www.microsoft.com/en-us/research/video/post-quantum-cryptography-supersingular-isogeny-problems/
Views: 1127 Microsoft Research
Cryptography with Auxiliary Input and Trapdoor from Constant Noise LPN
Yu Yu and Jiang Zhang, Crypto 2016. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=27711
Views: 126 TheIACR
35C3 -  The year in post-quantum crypto
https://media.ccc.de/v/35c3-9926-the_year_in_post-quantum_crypto The world is finally catching on to the urgency of deploying post-quantum cryptography: cryptography designed to survive attacks by quantum computers. NIST's post-quantum competition is in full swing, and network protocols are exploring post-quantum extensions. This talk will take the audience on a journey through selected recent highlights from the post-quantum world. Post-quantum cryptography has become one of the most active areas in cryptography, trying to address important questions from potential users. Is post-quantum cryptography secure? In the first ten months of this year we have seen several serious breaks of submissions to the NIST competition. At this point, out of the original 69 submissions, 13 are broken and 8 are partially broken. Are the remaining 48 submissions all secure? Or is this competition a denial-of-service attack against the cryptanalysis community? NIST will select fewer candidates for the 2nd round, but it is not clear whether there is an adequate basis for judging security. Does post-quantum cryptography provide the functionality we expect from cryptography? For example, the original Diffie-Hellman system provides not just encryption but also more advanced features such as non-interactive key exchange (not provided by any NIST submissions) and blinding. The era of post-NIST post-quantum cryptography has begun with the exciting new CSIDH proposal, which has non-interactive key exchange and is smaller than any NIST submission, but uses more CPU time and needs much more study. Is post-quantum cryptography small enough? Even for network protocols that rely purely on encryption, integration remains a major problem because of the bandwidth requirements of most post-quantum systems, especially the post-quantum systems with the strongest security track records. Experiments with integration of post-quantum cryptography into TLS have focused on encryption without post-quantum authentication. A new generation of network protocols has been designed from the ground up for full post-quantum security. Is post-quantum cryptographic software fast enough, and is it safe to use? Adding post-quantum cryptography to the cryptographic software ecosystem has produced a giant step backwards in software quality. Major areas of current activity include software speedups, benchmarking, bug fixes, formal verification, patent avoidance, and development of post-quantum software libraries such as Open Quantum Safe and libpqcrypto. The talk will be given as a joint presentation by Daniel J. Bernstein and Tanja Lange. djb Tanja Lange https://fahrplan.events.ccc.de/congress/2018/Fahrplan/events/9926.html
Views: 4049 media.ccc.de
Quantum Key Distribution and the Future of Encryption
By Konstantinos Karagiannis Quantum computing will bring tumultuous change to the world of information security in the coming decade. As multi-qubit systems use quantum algorithms to slice through even 4096-bit PK encryption in seconds, new Quantum Encryption will be required to ensure data security. Join Konstantinos for a look at real world experiments in Quantum Key Distribution that BT and partners have recently performed that show what the future of encryption will look like. Remember the panic after Heartbleed when SOME passwords needed to be changed? Imagine a day when ALL communications are at risk of eavesdropping via Quantum Computers - a day when only new systems that exploit the weirdness of quantum mechanics can ensure privacy.
Views: 8267 Black Hat
Nicolas Gisin - Quantum Cryptography: where do we stand?
Keynote Talk 1 by Nicolas Gisin at 5th International Conference on Quantum Cryptography (QCrypt 2015) in Hitotsubashi Hall, Tokyo, September 28th, 2015. Download the slides at: http://2015.qcrypt.net/scientific-program/
Views: 693 QCrypt 2015
Scott Aaronson - Quantum Computers and Cryptography
Scott Aaronson answers question on what the most important implications would be if a Quantum Computer could be built. Full lecture is available at - https://www.youtube.com/watch?v=s1bxNomtaTE
Views: 907 Albert Veli
Simulating Quantum Field Theory with a Quantum Computer
John Preskill, California Institute of Technology Quantum Hamiltonian Complexity Boot Camp http://simons.berkeley.edu/talks/john-preskill-2014-01-18
Views: 1360 Simons Institute
quantum cryptography
Introduction to the Quantum Cryptography lab
Views: 5148 Paul Francis
Philippe Gaborit - RankSign: An Efficient Signature Algorithm Based on the Rank  Metric
Philippe Gaborit of the University of Limoges and the XLIM Research Institute presented a talk titled: RankSign: An efficient signature algorithm based on the rank metric at the 2014 PQCrypto conference in October, 2014. Abstract: In this paper we propose a new approach to code-based signatures that makes use in particular of rank metric codes. When the classical approach consists in finding the unique preimage of a syndrome through a decoding algorithm, we propose to introduce the notion of mixed decoding of erasures and errors for building signature schemes. In that case the difficult problem becomes, as in the case in lattice-based cryptography, finding a preimage of weight above the Gilbert-Varshamov bound (case where many solutions occur) rather than finding a unique preimage of weight below the Gilbert-Varshamov bound. The paper describes RankSign: a new signature algorithm for the rank metric based on a new mixed algorithm for decoding erasures and errors for the recently introduced Low Rank Parity Check (LRPC) codes. We explain how it is possible (depending on choices of parameters) to obtain a full decoding algorithm which is able to find a preimage of reasonable rank weight for any random syndrome with a very strong probability. We study the semantic security of our signature algorithm and show how it is possible that no information leaks through signatures. Finally we give several examples of parameters for our scheme, some of which with public key of size 11, 520 bits and signature of size 1728 bits. Moreover the scheme can be very fast for small base fields. PQCrypto 2014 Book: http://www.springer.com/computer/security+and+cryptology/book/978-3-319-11658-7 Workshop: https://pqcrypto2014.uwaterloo.ca/ Find out more about IQC! Website - https://uwaterloo.ca/institute-for-qu... Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Cryptography Primer Session 6: Tools and Applications
This will be the sixth and final cryptography primer session exploring the basics of modern cryptography. In this session, we’ll explore some high-level tools that employ cryptographic techniques including zero-knowledge, secret sharing, and homomorphic encryption. We’ll then pull these tools together into the application of developing a verifiable election system wherein voters can check that their votes are properly counted without compromising their privacy.
Views: 152 Microsoft Research
Cryptography Primer Session 2 – Symmetric Primitives
This will be the second of six cryptography primer sessions exploring the basics of modern cryptography. In this session, we’ll explore symmetric ciphers, primitives, and protocols – including AES, cipher modes, hash functions, and message authentication. Subsequent sessions (on alternating Fridays) are expected to include the following topics. Depending on the interests of the participants, other topics may be included or substituted. • Integer asymmetric functions including BigNums, Diffie-Hellman, RSA, and DSA • Non-integer asymmetric functions including elliptic curves and lattice-based systems • Protocol properties including forward secrecy, crypto agility, and certificate management • Applications including zero-knowledge, secret sharing, homomorphic encryption, and election protocols
Views: 220 Microsoft Research
Quantum Cryptography: From Theory to Practice
Eleni Diamanti, CNRS - Télécom ParisTech Quantum Games and Protocols http://simons.berkeley.edu/talks/eleni-diamanti-2014-02-28
Views: 1476 Simons Institute
Post-Quantum RSA Cryptography
Quantum computing will kill RSA Cryptography unless you feel like using 8TB public keys. For the full episode, visit https://twit.tv/sn/618 Subscribe: https://twit.tv/subscribe About us: TWiT.tv is a technology podcasting network located in the San Francisco Bay Area with the #1 ranked technology podcast This Week in Tech hosted by Leo Laporte. Every week we produce over 30 hours of content on a variety of programs including Tech News Today, The New Screen Savers, MacBreak Weekly, This Week in Google, Windows Weekly, Security Now, All About Android, and more. Follow us: https://twit.tv/ https://twitter.com/TWiT https://www.facebook.com/TWiTNetwork https://www.instagram.com/twit.tv/
Views: 1143 TWiT Netcast Network
McEliece Cryptosystem
McEliece Cryptosystem... that's pretty much about it....
Views: 64 d htt
Mathematics in Post-Quantum Cryptography - Kristin Lauter
2018 Program for Women and Mathematics Topic: Mathematics in Post-Quantum Cryptography Speaker: Kristin Lauter Affiliation: Microsoft Research Date: May 21, 2018 For more videos, please visit http://video.ias.edu
Andreas Hülsing - Hash-Based Signatures
Title: Hash-Based Signatures Speaker Andreas Hülsing (Technische Universiteit Eindhoven) 2016 Post-Quantum Cryptography Winter School https://pqcrypto2016.jp/winter/
Views: 1242 PQCrypto 2016
dotSecurity 2017 - Tanja Lange - Post-Quantum Cryptography
Filmed at https://2017.dotsecurity.io on April 21st in Paris. More talks on https://dotconferences.com/talks By 2025, quantum computers could be here. These computers enable new types of computations and could break today’s encryption systems in no time. Even worse, secret transmissions from today can be broken retroactively. It is high time for new encryption methods to protect private and top-secret data against computers of the future.
Views: 962 dotconferences
What is cryptography?
A very short introduction to the science of cryptography by Jamie Sikora, a mathematician and Research Fellow at the Centre for Quantum Technologies at the National University of Singapore.
cryptography - Hash Functions
Cryptography To get certificate subscribe: https://www.coursera.org/learn/cryptography ======================== Playlist URL: https://www.youtube.com/playlist?list=PL2jykFOD1AWb07OLBdFI2QIHvPo3aTTeu ============================ Youtube channel: https://www.youtube.com/user/intrigano ============================ https://scsa.ge/en/online-courses/ https://www.facebook.com/cyberassociation/
Views: 1010 intrigano
01 Daniele Micciancio on "Lattice Cryptography: Introduction and Open Questions"
Daniele Micciancio's August 31 presentation on "Lattice Cryptography: Introduction and Open Questions" at the 2015 UCI Mathematics of Cryptography Conference
Code based crypto
MAD4471 at USF
Views: 88 USF Maths
Post quantum signatures | Melissa Chase (Microsoft Research) | RWC 2018
Technical talks from the Real World Crypto conference series.
Views: 900 Real World Crypto
GraphSC: Parallel Secure Computation Made Easy
GraphSC: Parallel Secure Computation Made Easy Kartik Nayak Presented at the 2015 IEEE Symposium on Security & Privacy May 18--20, 2015 San Jose, CA http://www.ieee-security.org/TC/SP2015/ ABSTRACT We propose introducing modern parallel programming paradigms to secure computation, enabling their secure execution on large datasets. To address this challenge, we present Graph SC, a framework that (i) provides a programming paradigm that allows non-cryptography experts to write secure code, (ii) brings parallelism to such secure implementations, and (iii) meets the need for obliviousness, thereby not leaking any private information. Using Graph SC, developers can efficiently implement an oblivious version of graph-based algorithms (including sophisticated data mining and machine learning algorithms) that execute in parallel with minimal communication overhead. Importantly, our secure version of graph-based algorithms incurs a small logarithmic overhead in comparison with the non-secure parallel version. We build Graph SC and demonstrate, using several algorithms as examples, that secure computation can be brought into the realm of practicality for big data analysis. Our secure matrix factorization implementation can process 1 million ratings in 13 hours, which is a multiple order-of-magnitude improvement over the only other existing attempt, which requires 3 hours to process 16K ratings.
Artur Ekert - QCrypt Public Lecture
Public Lecture by Artur Ekert at 5th International Conference on Quantum Cryptography (QCrypt 2015) in Hitotsubashi Hall, Tokyo, September 28th, 2015.
Views: 470 QCrypt 2015
Quantum Cryptography Lecture
Quantum laser pointers brings you the infamous double slit experiment right in the palm of your hand. In 1801 English physicist Thomas Young performed this experiment to determine if light was a particle or a wave. A laser shines a coherent beam of light through a film disc containing two parallel slits. Light striking the wall behind the slits producers a classic interference pattern. This surprising result means light passes through the parallel slits not as particles but as waves. When the peaks of two waves overlap it creates a band of light. When the peak of one wave meets the valley of another, light is cancelled out. Variations of this experiment spurred public debates between Albert Einstein and Neils Bohr on the true nature of reality. It’s been called the granddaddy of all quantum weirdness. This convenient and affordable double slit laser was designed for personal enjoyment and education.
What is Post Quantum Cryptography?
What if all "secured" websites could no longer be trusted to keep your data safe? The impact on eCommerce, banking, and other websites we use every day would be devastating. Learn about Quantum Computing, and why this is a very real risk not too far away. Download the guide to learn more https://web.securityinnovation.com/what-is-post-quantum-cryptography.
Views: 6264 Security Innovation
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key
We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly parametrizable. In our signature constructions, the public key is an image y=f(x) of a one-way function f and secret key x. A signature is a non-interactive zero-knowledge proof of x, that incorporates a message to be signed. For this proof, we leverage recent progress of Giacomelli et al. (USENIX'16) in constructing an efficient sigma protocol for statements over general circuits. We improve this sigma protocol to reduce proof sizes by a factor of two, at no additional computational cost. While this is of independent interest as it yields more compact proofs for any circuit, it also decreases our signature sizes. We consider two possibilities for making the proof non-interactive, the Fiat-Shamir transform, and Unruh's transform (EUROCRYPT'12,'15,'16). The former has smaller signatures, while the latter has a security analysis in the quantum-accessible random oracle model. By customizing Unruh's transform to our application, the overhead is reduced to 1.6x when compared to the Fiat-Shamir transform, which does not have a rigorous post-quantum security analysis. We implement and benchmark both approaches and explore the possible choice of f, taking advantage of the recent trend to strive for practical symmetric ciphers with a particularly low number of multiplications and end up using LowMC. This is joint work with Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Christian Rechberger, Daniel Slamanig and Greg Zaverucha.  See more on this video at https://www.microsoft.com/en-us/research/video/post-quantum-zero-knowledge-and-signatures-from-symmetric-key/
Views: 1084 Microsoft Research
Norbert Lütkenhaus - Quantum Key Distribution Networks
Views: 19 SFB 1119 CROSSING
Cryptography - IASG Meeting 02/21/2017
Alex Scheel gives his talk on cryptography during IASG's meeting on February 21, 2017. "An exploratory look at a series of cryptographic constructs from the Ancient Greeks to the current century. Focuses on introducing basic components of cryptography, including symmetric and asymmetric encryption and hash functions. Emphasis on select weaknesses; discussion about how to Do Things Right™." See past presentation slide decks: https://drive.google.com/drive/folders/0By6whaxOBgbFLUNJRWFhbDJIZGM?usp=sharing _________________________________________________ Outro Song: Song: JJD - Future [NCS Release] Music provided by NoCopyrightSounds. Video Link: https://youtu.be/n1ddqXIbpa8 Download: http://NCS.lnk.to/Future
The physics of cryptography - Renato Renner
Renato Renner of ETH Zürich presented an invited talk: The physics of cryptography at the 2013 QCrypt Conference in August. http://2013.qcrypt.net Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Liang Jiang - Efficient long distance quantum communication
Invited Talk 4 by Liang Jiang at 5th International Conference on Quantum Cryptography (QCrypt 2015) in Hitotsubashi Hall, Tokyo, October 1st, 2015. Download the slides at: http://2015.qcrypt.net/scientific-program/
Views: 658 QCrypt 2015
Quantum Computing and Impact On Public Key Encryption - Prof Alan Woodward
The associated research paper is here: http://www.iidi.napier.ac.uk/c/publications/publicationid/13386510
Views: 1271 The Cyber Academy
[EN] Side-channel Attack of a Quantum Key Distribution System, Martina Bodini
We are never so vulnerable than when we feel safe. Quantum key distribution systems are the first place to go if looking for best state-of-art secure transmission. They rely on an intrinsic principle, a system cannot be measured without perturbing it so, in theory, quantum encryption keys cannot be intercepted without being noticed. But an algorithm is known to be resistant until it fails, even theoretically perfect setups can be hacked: blinding a receiver is only a way to crack a quantum key, yet leaving no trace. Unconditional secure transmissions could be bypassed by simply acting on the boundary. Strong quantum physics skills are not needful for delving further into these points, it is important to have knowledge of how quantum computers work, and how they differ from traditional machines: during the talk, an initial overview will provide all the necessary keys to go deeper, from the concept of quantum entanglement, without which quantum computers would not exist, to implications that far outpace conventional approaches to computing. Working in the Quantum Optics field brought me in close contact with some physical limitations, rather than particular technological weaknesses. A practical quantum key distribution system consists of a transmitter and a series of detectors: in an ideal world the detectors are identical, but in practice manufacturing devices with the same features is literally impossible. As a consequence, for the same quantum key distribution system there are detectors working with different detection efficiencies depending on frequency, polarisation and spatial domain (case 1: detection efficiency of the bits “0” and “1” are unbalanced; case 2: two or more detectors of the same system responds differently when working under identical conditions). A lack of accuracy emerges from the low detection efficiency caused by detectors mismatch, giving an eavesdropper a powerful handle to gain useful information on the key without being noticed. We will see how this implicate a non-negligible probability to break the security of “unconditionally unbreakable” networks: an experimental demonstration of an outstanding side channel attack against a commercial quantum key distribution system conducted by third parties will be discussed.
Views: 282 Asso HZV
Quantum Cryptography PPT
Quantum cryptography promises to revolutionize secure communication by providing security based on the fundamental laws of physics, instead of the current state of mathematical algorithms or computing technology. #QuantumComputing #Cryptography #Computer Visit https://www.topicsforseminar.com/2014/04/quantum-cryptography-seminar-report-and.html to Download
Views: 3881 Topics For Seminar
The Learning with Rounding Problem: Reductions and Applications
In this talk I will survey a recently introduced cryptographic problem called Learning with Rounding (LWR). I will show reductions from and to the more well-established Learning with Errors (LWE) problem, and demonstrate the applicability of LWR to the construction of efficient Pseudorandom Functions and other cryptographic primitives.
Views: 265 Microsoft Research
CCS 2016 - SANA: Secure and Scalable Aggregate Network Attestation
Authors: Moreno Ambrosin, Mauro Conti (University of Padua), Ahmad Ibrahim (TU Darmstadt), Gregory Neven (IBM Research), Ahmad-Reza Sadeghi (TU Darmstadt) and Matthias Schunter (Intel Labs – Darmstadt) presented at CCS 2016 - the 23rd ACM Conference on Computer and Communications Security (Hofburg Palace Vienna, Austria / October 24-28, 2016) - organized by SBA Research
Views: 172 CCS 2016
Secure Hashing and Digital Signatures
Embedded System Software Tutorial: Cryptography Prof. Phil Koopman, Carnegie Mellon University For slides, see: https://users.ece.cmu.edu/~koopman/lectures/
Views: 60 Phil Koopman
Nicolas Gisin - Invited Talk - Quantum Cryptography
Nicolas Gisin of the University of Geneva presented an invited talk titled: Quantum cryptography at the 2014 PQCrypto conference in October, 2014. PQCrypto 2014 Book: http://www.springer.com/computer/security+and+cryptology/book/978-3-319-11658-7 Workshop: https://pqcrypto2014.uwaterloo.ca/ Find out more about IQC! Website - https://uwaterloo.ca/institute-for-qu... Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Flush, Gauss, and Reload    A Cache Attack on the BLISS Lattice Based Signature Scheme
Leon Groot Bruinderink and Andreas Hülsing and Tanja Lange and Yuval Yarom, CHES 2016. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=27851
Views: 475 TheIACR