Home
Search results “Advantages of lattice based cryptography research”
Lattice-Based Cryptography
 
01:12:48
Most modern cryptography, and public-key crypto in particular, is based on mathematical problems that are conjectured to be infeasible (e.g., factoring large integers). Unfortunately, standard public-key techniques are often too inefficient to be employed in many environments; moreover, all commonly used schemes can in principle be broken by quantum computers. This talk will review my recent work on developing new mathematical foundations for cryptography, using geometric objects called lattices. Compared to more conventional proposals, lattice-based schemes offer a host of potential advantages: they are simple and highly parallelizable, they can be proved secure under mild worst-case hardness assumptions, and they remain unbroken by quantum algorithms. Due to the entirely different underlying mathematics, however, realizing even the most basic cryptographic notions has been a major challenge. Surprisingly, I will show that lattice-based schemes are also remarkably flexible and expressive, and that many important cryptographic goals can be achieved --- sometimes even more simply and efficiently than with conventional approaches. Some of our schemes provide interesting twists on old and cherished cryptographic notions, while others introduce entirely new concepts altogether.
Views: 2346 Microsoft Research
Pairing-based proof systems and applications to anonymous credentials
 
46:58
Pairing based cryptography has resulted in a number of breakthrough results, including some major developments in the area of zero knowledge proof systems. A zero knowledge proof system allows a party to prove that a statement is true without revealing any other information. Zero knowledge proofs are used in everything from identification protocols (allowing a party to prove that he is who he claims to be) and encryption schemes with stronger security properties, to securing protocols against malicious adversaries, and constructing privacy preserving systems. It has been shown that zero knowledge proofs can be constructed from a variety of number theoretic assumptions (or, more generally from any trapdoor permutation); however most of these constructions are complex and inefficient. In '06 Groth, Ostrovsky, an Sahai showed how to construct proof systems based on pairings which have much more structure than traditional constructions; this structure in turn has since been shown to result in proof systems with greater efficiency, stronger security, and more functionality. This talk will describe at a high level how pairings allows us to construct zero knowledge proofs with more structure than traditional tools, and then discuss some of the applications that take advantage of this structure, focusing on applications to privacy and anonymity.
Views: 905 Microsoft Research
Bitcoin Q&A: Migrating to post-quantum cryptography
 
06:47
Keywords/phrases: Quantum cryptography, quantum cryptoanalysis, quantum computing. Bitcoin uses SHA-256. In cryptography there is a 20-30 year lifecycle for an algorithm before it gets exceeded by new technologies and developments in mathematics. Both the signing and hashing algorithms can be upgraded in Bitcoin if there is a need to do that. Quantum cryptography represents a threat only if unevenly distributed in commercial sectors. If it is available to only one actor, and not all actors, they are unlikely to use it against Bitcoin; instead they're going to keep it secret and use it when they're threatened by ex. cryptographically secure nuclear weapons. Intelligence agencies who have that kind of significant computing advantage don't use it until there is a dire emergency, because once you use it everyone will know you have it. After that all the algorithms get changed, so you better make it good. If it is widely available, all the miners update to quantum computers and we're going to be looking at several orders of magnitude in improvement, because running one is neither free nor easy. We don't know what the economics will be yet, but we will solve problems when it's necessary. Corporations and governments are not going to be happy with Bitcoin. Kings were not happy and yet the revolution happened anyway. Bitcoin is a global and technological revolution. They have adapted to new technologies for hundreds of years. The fact that they won't be happy doesn't concern me, because Bitcoin is a system that doesn't require their permission, approval, or cooperation. They can pretend it's going away but it isn't. We can talk all day about whether the government should or shouldn't regulate Bitcoin, but the real question is whether they can. They can regulate at the edge, the behaviour of users, but they can't regulate Bitcoin itself. Bitcoin is exciting because it introduces a new choice; it's not saying you can't do the old way (hierarchical central banking, border-restricted jurisdictions for currencies ), it's saying we can also do this.
Views: 18450 aantonop
Charles River Crypto Day - The Power of Negations in Cryptography
 
01:12:19
The study of monotonicity and negation complexity for Boolean functions has been prevalent in complexity theory as well as in computational learning theory, but little attention has been given to it in the cryptographic context. Recently, Goldreich and Izsak (2012) have initiated a study of whether cryptographic primitives can be monotone, and showed that one-way functions can be monotone (assuming they exist), but a pseudorandom generator cannot. In this work, we start by filling in the picture and proving that many other basic cryptographic primitives cannot be monotone. We then initiate a quantitative study of the power of negations, asking how many negations are required. We provide several lower bounds, some of them tight, for various cryptographic primitives and building blocks including one-way permutations, pseudorandom functions, small-bias generators, hard-core predicates, error-correcting codes, and randomness extractors. Among our results, we highlight the following. i) Unlike one-way functions, one-way permutations cannot be monotone. ii) We prove that pseudorandom functions require log n−O(1) negations (which is optimal up to the additive term). iii) Error-correcting codes with optimal distance parameters require log n−O(1) negations (again, optimal up to the additive term). iv) We prove a general result for monotone functions, showing a lower bound on the depth of any circuit with t negations on the bottom that computes a monotone function f in terms of the monotone circuit depth of f. This result addresses a question posed by Koroth and Sarma (2014) in the context of the circuit complexity of the Clique problem. Joint work with Siyao Guo, Igor Carboni Oliveira, and Alon Rosen.
Views: 220 Microsoft Research
Cryptographic Program Obfuscation: Current Capabilities and Challenges
 
47:43
Cryptographic program obfuscation (CPO) enables the evaluation of obfuscated programs/circuits for non-encrypted inputs using cryptographic approaches based on standard (or almost standard) security assumptions. CPO is a hot topic of cryptography that has recently seen remarkable progress, fueled by the DARPA SafeWare program. CPO has a lot of potential high-impact applications for the defense industry, specifically in classification problems and other areas of machine learning. Many recent advances in CPO have come from the cryptographic primitives based on lattices. This talk reviews some of these advances and current capabilities/applications of lattice-based CPO protocols from the perspective of PALISADE, an open-source lattice cryptography library that is being developed by the NJIT Cybersecurity Research Center in collaboration with its partners in academia, government, and industry. The current challenges limiting the practicability of CPO are also discussed. See more at https://www.microsoft.com/en-us/research/video/cryptographic-program-obfuscation-current-capabilities-challenges/
Views: 472 Microsoft Research
Homomorphic Encryption from Ring Learning with Errors
 
51:09
The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns that can be satisfactorily addressed if users encrypt the data they send to the cloud. If the encryption scheme is homomorphic, the cloud can still perform meaningful computations on the data, even though it is encrypted. In fact, we now know a number of constructions of fully homomorphic encryption schemes that allow arbitrary computation on encrypted data. In the last two years, solutions for fully homomorphic encryption have been proposed and improved upon, but all currently available options seem to be too inefficient to be used in practice. However, for many applications it is sufficient to implement somewhat homomorphic encryption schemes, which support a limited number of homomorphic operations. They can be much faster, and more compact than fully homomorphic schemes. This talk will focus on describing the recent somewhat homomor- phic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the ring learning with errors (RLWE) problem.
Views: 577 Microsoft Research
The Cryptographers’ Panel 2018
 
41:14
Moderator: Zulfikar Ramzan, Chief Technology Officer, RSA Ron Rivest, Institute Professor, MIT Adi Shamir, Professor, Computer Science Department, Weizmann Institute of Science, Israel Whitfield Diffie, Cryptographer and Security Expert, Cryptomathic Paul Kocher, Independent Researcher Moxie Marlinspike, Founder, Signal Despite how sophisticated information security has become, it is still a relatively young discipline. The founders of our field continue to be actively engaged in research and innovation. Join us to hear these luminaries engage in an enlightening discussion on the past, present and future of our industry. https://www.rsaconference.com/events/us18/agenda/sessions/11490-The-Cryptographers%E2%80%99-Panel
Views: 4384 RSA Conference
A Framework for the Sound Specification of Cryptographic Tasks
 
01:08:37
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the 'trusted-party paradigm,' where the protocol execution is compared with an ideal process where the outputs are computed by a trusted party that sees all the inputs. A protocol is said to securely carry out a given task if running the protocol with a realistic adversary amounts to 'emulating'' the ideal process with the appropriate trusted party. In the Universal Composability (UC) framework the program run by the trusted party is called an /ideal functionality/. While this simulation-based security formulation provides strong security guarantees, its usefulness is contingent on the properties and correct specification of the ideal functionality, which, as demonstrated in recent years by the coexistence of complex, multiple functionalities for the same task as well as by their 'unstable' nature, does not seem to be an easy task. In this work we address this problem, by introducing a general methodology for the sound specification of ideal functionalities. First, we introduce the class of /canonical/ ideal functionalities for a cryptographic task, which unifies the syntactic specification of a large class of cryptographic tasks under the same basic template functionality. Furthermore, this representation enables the isolation of the individual properties of a cryptographic task as separate members of the corresponding class. By endowing the class of canonical functionalities with an algebraic structure we are able to combine basic functionalities to a single final canonical functionality for a given task. Effectively, this puts forth a bottom-up approach for the specification of ideal functionalities: first one defines a set of basic constituent functionalities for the task at hand, and then combines them into a single ideal functionality taking advantage of the algebraic structure. We showcase our methodology by applying it to a variety of basic cryptographic tasks, including commitments, digital signatures, zero-knowledge proofs, and oblivious transfer. While in some cases our derived canonical functionalities are equivalent to existing formulations, thus attesting to the validity of our approach, in others they differ, enabling us to 'debug' previous definitions and pinpoint their shortcomings. This is joint work with Aggelos Kiayias (Univ. of Athens and Univ. of Connecticut) and Hong-Sheng Zhou (Univ. of Maryland).
Views: 38 Microsoft Research
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key
 
33:34
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: 851 Microsoft Research
The Cryptographic Lens: Visions of our Past and Future
 
57:12
Shafi Goldwasser, MIT Symposium on Visions of the Theory of Computing, May 30, 2013, hosted by the Simons Institute for the Theory of Computing at UC Berkeley.
Views: 1512 Simons Institute
2006-09-27 CERIAS - The Secure Information Sharing Problem and Solution Approaches
 
01:00:26
Recorded: 09/27/2006 CERIAS Security Seminar at Purdue University The Secure Information Sharing Problem and Solution Approaches Ravi Sandhu, George Mason University The secure information sharing problem is one of the oldest and most fundamental and elusive problems in information security. Mission objectives dictate that Information must be shared and made available to authorized recipients, and yet information must be protected from leakage and subversion by malicious insiders and malicious software. The doctrine of "share but protect" indicates the inherent conflict in achieving effective secure information sharing. In this talk we demonstrate the complexity and richness of the secure information sharing problem space. We then identify some "sweet spots" that appear promising in their practical benefit and feasibility of solutions. We describe the PEI models approach to decompose security problems into the three layers of policy models (topmost), enforcement models (middle), and implementation models (bottom). We discuss how this approach can be applied to the secure information sharing problem. Finally we indicate how modern trusted computing technology can be used to solve important variations of this problem. Dr. Ravi Sandhu earned B.Tech. and M.Tech. degrees from IIT Bombay and Delhi respectively, and M.S. and Ph.D. degrees from Rutgers University. He is a Fellow of ACM and IEEE, and recipient of the IEEE Computer Society Technical Achievement Award. His research has focused on information security, privacy and trust, with special emphasis on models, protocols and mechanisms. His doctoral work on safety and expressive power of access control was further developed by him culminating in the Typed Access Matrix in 1992. In collaboration with Prof. Jajodia, he analyzed and reconciled confidentiality and integrity in multilevel secure databases. In 1993 he showed that Chinese Wall separation of duty policies were instances of information flow. In 1996, along with industry colleagues, he published the seminal paper on role-based access control which evolved into the 2004 NIST/ANSI standard RBAC model. In 2002, with Jaehong Park, he introduced the Usage Control model for next-generation access. Other recent activities include Information Sharing models and implementations using Trusted Computing, and the PEI (policy, enforcement and implementation) layered models method for synthesizing secure systems. Ravi has published over 160 technical papers on information security, has received over 30 research grants and has graduated 12 PhD's in his career.Ravi is the founding editor of the Synergy Lecture Series on Information Security, Privacy and Trust. Earlier, he was the founding editor-in-chief of the ACM Transactions on Information and Systems Security (TISSEC), from 1997 to 2004. He was Chairman of ACM SIGSAC from 1995 to 2003, and founded and led the ACM Conference on Computer and Communications Security and the ACM Symposium on Access Control Models and Technologies to high reputation and prestige. He served as the security editor for IEEE Internet Computing from 1998 to 2004. In 2000 Ravi Sandhu co-founded the company now known as TriCipher and continues to serve as its Chief Scientist. He is the principal security architect of the TriCipher Armored Credential System. He is an inventor on eight security technology patents and has over fifteen patents pending. He is also the principal architect of the M.S. and Ph.D. programs in Information Security and Assurance at George Mason University. (Visit: www.cerias.purude.edu)
Views: 535 ceriaspurdue
Fiat Cryptography: Automatic Correct-by-Construction Generation of Low-Level Cryptographic Code
 
01:05:21
Some of the most widely used cryptographic protocols, including TLS, depend on fast execution of modular big-number arithmetic. Cryptographic primitives are coded by an elite set of implementation experts, and most programmers are shocked to learn that performance-competitive implementations are rewritten from scratch for each new prime-number modulus and each significantly different hardware architecture. In the Fiat Cryptography project, we show for the first time that an automatic compiler can produce this modulus-specialized code, via formalized versions of the number-theoretic optimizations that had previously only been applied by hand. Through experiments for a wide range of moduli, compiled for 64-bit x86 and 32-bit ARM processors, we demonstrate typical speedups vs. an off-the-shelf big-integer library in the neighborhood of 5X, sometimes going up to 10X. As a bonus, our compiler is implemented in the Coq proof assistant and generates proofs of functional correctness. These combined benefits of rigorous correctness/security guarantees and labor-saving were enough to convince the Google Chrome team to adopt our compiler for parts of their TLS implementation in the BoringSSL library. The project is joint work with Andres Erbsen, Jade Philipoom, Jason Gross, and Robert Sloan.  See more at https://www.microsoft.com/en-us/research/video/fiat-cryptography-automatic-correct-by-construction-generation-of-low-level-cryptographic-code/
Views: 784 Microsoft Research
The post-graduate student solved the task of storing information in DNA
 
01:09
https://kcn.media The graduate student Sander Wuyts has successfully solved the problem of storing digital information in DNA. This task was set by the professor of the European Institute of Bioinformatics Nick Goldman who offered to read the keys within a cryptocurrency encrypted in this way, in order to receive 1 bitcoin as a reward. “The DNA contained: instructions how to get a bitcoin, the logo of the European Institute of Bioinformatics and some other things,” the author of the project said. “I had doubts about the possibility of using DNA to store data. But now I know very well that this new technology offers great opportunities, maybe even for my own future research,” he said. At the time of setting the task a bitcoin was cost about $329, and now its price is about $11,000. Our partner: https://pluscoin.io/ Our website: https://kcn.media Our service list: https://kcn.media/our-services We are on twitter: https://twitter.com/KolesCoinNews We are on facebook: https://www.facebook.com/KolesCoinNews/ We are on Steemit: https://steemit.com/@kcnnews We are on Medium: https://medium.com/koles-coin-news We are on linkedin: https://www.linkedin.com/groups/12025958 We are on Blogger: http://kolescoinnews.blogspot.com/ We are on google+: https://plus.google.com/b/102188026596616035629/collection/0DA-cB _ #kcn #kolescoinnews #cryptocurrency #bitcoin #blockchain #mining #token #ICO #future #technologies #fintech #coinmarketcap Info:
Views: 59 KCN News
Ray Perlner - Optimizing Information Set Decoding Algorithms to Attach Cyclosymmetric MDPC Codes
 
19:05
Ray Perlner of the National Institute of Standards and Technology presented a talk titled: Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes at the 2014 PQCrypto conference in October, 2014. Abstract: Recently, several promising approaches have been proposed to reduce keysizes for code based cryptography using structured, but non-algebraic codes, such as quasi-cyclic (QC) Moderate Density Parity Check (MDPC) codes. Biasi et al. propose further reducing the keysizes of code-based schemes using cyclosymmetric (CS) codes. While Biasi et al. analyze the complexity of attacking their scheme using standard information-set-decoding algorithms, the research presented here shows that information set decoding algorithms can be improved, by choosing the columns of the information set in a way that takes advantage of the added symmetry. The result is an attack that significantly reduces the security of the proposed CS-MDPC schemes to the point that they no longer offer an advantage in keysize over QC-MDPC schemes of the same security level. QC-MDPC schemes are not affected by this paper's result. 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
2011 Killian Lecture: Ronald L. Rivest, "The Growth of Cryptography"
 
01:09:19
Lecture title: "The Growth of Cryptography" Ronald L. Rivest, a professor of electrical engineering and computer science who helped develop one of the world's most widely used Internet security systems, was MIT’s James R. Killian, Jr. Faculty Achievement Award winner for 2010–2011. Rivest, the Andrew and Erna Viterbi professor in MIT's Department of Electrical Engineering and Computer Science, is known for his pioneering work in the field of cryptography, computer, and network security. February 8, 2011 Huntington Hall (10-250)
WACV18: Tutorial: Part 1: When Blockchain Meets Computer Vision: Opportunities and Challenges
 
02:49:34
Organizers: Karthik Nandakumar, Sharathchandra Pankanti, Nalini Ratha (IBM Singapore Lab; IBM Thomas J. Watson Research Center) Description: It is widely acknowledged that blockchain is foundational technology that will revolutionize the way transactions are conceived, executed, managed, and monetized. While the technological benefits of the blockchain infrastructure are imminent, the underlying technological problems need significant attention from researchers. Of specific interest to computer vision researchers and application developers is the opportunity to make a connection to these emerging infrastructure capabilities, and realize how their skills can be leveraged to make an impact. As the camera-based infrastructure is becoming ubiquitous and compute power is becoming pervasively available, the business world is going to look to camera as a default sensor, and camera-based analytics as a de facto information channel to improve the integrity of transactions. For instance, many complex practical challenges such as usability, compliance with regulations, integrity of transaction artifacts, and protecting privacy of sensitive information, can be effectively addressed using blockchain technology. The tutorial is aimed as a gentle introduction to the broader world of distributed transaction environment, and specifically blockchain technology. The tutorial will first introduce the blockchain technical concepts and capabilities in the context of real computer vision applications. The tutorial will subsequently review real application scenarios, where blockchain has tremendous potential to accelerate its use as an enterprise transaction infrastructure. The key technical challenges will be concretely couched in real mainstream use-cases such video surveillance and would cover many important aspects such privacy of end-users, scalability and cost-effectiveness, and user friendliness. Solving these problems requires multi-disciplinary research effort at the intersection of blockchain, artificial intelligence, and user behavior modeling.
FPGA - More Details on How To Configure and FPGA the bitstream files
 
04:41
FPGA computing systems: Background knowledge and introductory materials Module 2 Reconfigurable Computing and FPGAs To get certificate subscribe at: https://www.coursera.org/learn/intro-fpga-design-embedded-systems ============================ FPGA computing systems: Background knowledge and introductory materials https://www.youtube.com/playlist?list=PL2jykFOD1AWaFLEJm5H4GhRhPX_Ffi0wh ============================ Youtube channel: https://www.youtube.com/user/intrigano ============================ https://scsa.ge/en/online-courses/ https://www.facebook.com/cyberassociation/ About this course: This course is for anyone passionate in learning how a hardware component can be adapted at runtime to better respond to users/environment needs. This adaptation can be provided by the designers, or it can be an embedded characteristic of the system itself. These runtime adaptable systems will be implemented by using FPGA technologies. Within this course we are going to provide a basic understanding on how the FPGAs are working and of the rationale behind the choice of them to implement a desired system. This course aims to teach everyone the basics of FPGA-based reconfigurable computing systems. We cover the basics of how to decide whether or not to use an FPGA and, if this technology will be proven to be the right choice, how to program it. This is an introductory course meant to guide you through the FPGA world to make you more conscious on the reasons why you may be willing to work with them and in trying to provide you the sense of the work you have to do to be able to gain the advantages you are looking for by using these technologies. The course has no prerequisites and avoids all but the simplest mathematics and it presents technical topics by using analogizes to help also a student without a technical background to get at least a basic understanding on how an FPGA works. One of the main objectives of this course is to try to democratize the understanding and the access to FPGAs technologies. FPGAs are a terrific example of a powerful technologies that can be used in different domains. Being able to bring this technologies to domain experts and showing them how they can improve their research because of FPGAs, can be seen as the ultimate objective of this course. Module 2 Reconfigurable Computing and FPGAs From the mid-1980s, reconfigurable computing has become a popular field due to the FPGA technology progress. An FPGA is a semiconductor device containing programmable logic components and programmable interconnects but no instruction fetch at run time, that is, FPGAs do not have a program counter. In most FPGAs, the logic components can be programmed to duplicate the functionality of basic logic gates or functional Intellectual Properties (IPs). FPGAs also include memory elements composed of simple flip-flops or more complex blocks of memories. Hence, FPGA has made possible the dynamic execution and configuration of both hardware and software on a single chip. This module provides a detailed description of FPGA technologies starting from a general description down to the discussion on the low-level configuration details of these devices, to the bitstream composition and the description of the configuration registers.
Views: 64 intrigano
Intervalue ICO AMA with CryptoArnie | The Underdog 4.0 DAG Project Rivaling Hashgraph, IOTA & Seele
 
01:45:53
Website: http://www.inve.one/ Intervalue Telegram: https://t.me/joinchat/HFJWYxCcv_bhLzTrdfzmGQ CryptoArnie Telegram: https://t.me/CryptoArniePublic What is InterValue? The InterValue project focuses on the core technology of Blockchain infrastructure and platform level. The goal is to build the underlying infrastructure covering all fields at the ecological level, which conquers the key technical problems. Main Technological Innovation (1)In the communication layer of the underlying P2P network node: The original anonymous P2P communication network is realized by combining the existing Tor-based anonymous communication network, the Blockchain-based distributed VPN and the advantages of the Blockchain-based distributed content sharing network. The protocol of node anonymity access is designed, and the private encrypted communication protocol is realized. These two protocols greatly enhance the anonymity of nodes in the underlying communication network and ensure that the communication between nodes is hard to be traced and cracked. (2)At the underlying data structure Layer A new data structure with an enhanced directed acyclic graph (HashNet) is adopted, which greatly reduces the storage space required by the nodes and improves the efficiency and security of the underlying data storage. (3)At the consensus mechanism Layer We designed three different consensus mechanism: a HashNet based consensus mechanism, BA-VRF consensus mechanism, basic DAG consensus mechanism. A consensus mechanism based on HashNet to enhance the consensus of DAG and BA-VRF consensus mechanism for notary selection is presented. In project version 1.0, due to the fact that HashNet-based DAG consensus is more difficult to implement, we first implement a two-Layer consensus mechanism that combines DAG consensus with BA-VRF. These consensuses all support high transaction concurrency, fast transaction confirmation speed, and building eco-systems for different application scenarios. (4)At the Layer of anti-quantum attack New anti-quantum algorithms are adopted, which replaces the existing SHA series algorithm with the Keccak-512 hash algorithm, and replaces the ECDSA signature algorithm with an integer lattice-based NTRUsign signature algorithm. These algorithms reduce the threat which brings from the quantum computing development and gradual popularization of a quantum computer. (5)At the Layer of anonymous transaction Combined with the characteristics of cryptocurrency such as Monroe and ZCash, the zero-knowledge proof and ring signature are used to design transaction anonymity and privacy protection method with high effective cost ratio and excellent security to meet privacy requirements of different application scenarios. (6)At the Layer of smart contracts We adopt the Turing comprehensive contract with fair distribution mechanism and support the issuance of third-party assets, which can take place in the form of the public Blockchain, permission (private) Blockchain, consortium (hybrid) Blockchain to the actual application scenario. (7)At the Layer of cross-link communication and multi-chain fusion The use of relay chain technology to cross-chain communication and multi-chain fusion function module as a single layer overlay to achieve, not only can maintain the independence of cross-chain operation, but also reuse InterValue basis chain Various functions. (8)At the ecologically motivated Layer Various Token allocation tools and methods are used in combination and support for double-layer mining for miners' incentives. (9)At the industry application level The development of JSON-RPC industry common interfaces, such as circulation payment, data transmission, data search, and contract invocation, supports various applications at the upper level.
Views: 2409 Crypto Arnie
Chris Penn, Brain+Trust Insights | IBM Think 2018
 
25:09
Chris Penn, Co-Founder and Chief Innovator at Brain+Trust Insights, sits down with Dave Vellante on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.
Science Slam 2018: keynote speaker Katie Mack
 
50:09
Astrophysicist Katie Mack, known on Twitter as AstroKatie, was the keynote speaker and emcee for the 2018 event. Mack is a theoretical astrophysicist who studies a range of questions in cosmology, the study of the universe from beginning to end. She is an assistant professor of physics at North Carolina State University, where she is also a member of the Leadership in Public Science Cluster. Throughout her career she has studied the early universe, galaxy formation, black holes, cosmic strings and the ultimate fate of the cosmos. Alongside academic research, Mack is an active science communicator and has been published in a number of popular publications such as Scientific American, Slate, Sky and Telescope, Time.com, and Cosmos Magazine, where she is a columnist.
Post-Quantum Cryptography with Nick Sullivan and Adam Langley: GCPPodcast 123
 
42:10
Original post: https://www.gcppodcast.com/post/episode-123-post-quantum-cryptography-with-nick-sullivan-and-adam-langley/ Nick Sullivan, and Adam Langley join Melanie and Mark to provide a pragmatic view on post-quantum cryptography and what it means to research security for the potential of quantum computing. Post-quantum cryptography is about developing algorithms that are resistant to quantum computers in conjunction with “classical” computers. It’s about looking at the full picture of potential threats and planning on how to address them using a diversity of types of mathematics in the research. Adam and Nick help clarify the different terminology and techniques that are applied in the research and give a practical understanding of what to expect from a security perspective.
A Secure and Efficient ID-Based Aggregate Signature Scheme for Wireless Sensor Networks
 
03:18
Abstract—Affording secure and efficient big data aggregation methods is very attractive in the field of wireless sensor networks research. In real settings, the wireless sensor networks have been broadly applied, such as target tracking and environment remote monitoring. However, data can be easily compromised by a vast of attacks, such as data interception and data tampering, etc. In this paper, we mainly focus on data integrity protection, give an identity-based aggregate signature scheme with a designated verifier for wireless sensor networks. According to the advantage of aggregate signatures, our scheme not only can keep data integrity, but also can reduce bandwidth and storage cost for wireless sensor networks. Furthermore, the security of our identity-based aggregate signature scheme is rigorously presented based on the computational Diffie-Hellman assumption in random oracle model. TO GET FULL SOURCE CODE CONTACT +91 90036 28940 [email protected]
Views: 109 NS2 PROJECTS
Enforcing File Robustness in the Cloud; Efficient Verification of Outsourced Data and Computations
 
01:05:44
Segment II 11:10 am ΓÇô 12:30 pm Writing on Wind and Water: Enforcing File Robustness in the Cloud Ari Juels, RSA Laboratories The Cloud abstracts away infrastructural complexity for the benefit of tenants. But to tenants' detriment, it can also abstract away vital security information. In this talk, I discuss several protocols for remote testing of cloud storage integrity and robustness. Executing these protocols without detailed infrastructural knowledge or trust in cloud providers, clients or auditors can: (1) Verify the integrity of full files without downloading them; (2) Distribute files across cloud providers and ensure strong robustness with periodic, inexpensive checks (in a cloud analog to RAID); and (3) Test whether files are resilient to drive crashes. Joint work with Kevin Bowers, Marten van Dijk, Burt Kaliski, Alina Oprea, and Ron Rivest. Efficient Verification of Outsourced Data and Computations Charalampos Papamanthou, Brown University With the prevalence of the Internet in every aspect of our life, there has been an increasing interest in remote storage of data and structured information (e.g., emails, photos). This trend has given rise to a new discipline, termed under the name ΓÇ£cloud computing,ΓÇ¥ widely adopted by many companies (and individuals) in order to save operating and maintenance costs. However, as remote repositories (i.e., the cloud) may lose or modify data due to errors or malicious attacks, it is important to develop methods that provide strong assurance to the users of the integrity of the outsourced data. In order to address the above problems, one has to take into consideration that the produced solutions are efficient. In other words, if the security added to a cloud service leads to slow performance, the user might reject the service, since, although secure and trusted, the experienced overhead (time, bandwidth) by the service might be unacceptable. This talk explores integrity checking solutions that go beyond traditional hash-based methods, towards improving efficiency and achieving better asymptotic bounds. The systematic application of multiple cryptographic primitives, such as accumulators and lattices, leads to the proposal of new authenticated data structures schemes that compare favorably with existing solutions. We conclude by also reporting on some practical work we have done to address the aforementioned problems. This is joint work with Roberto Tamassia and Nikos Triandopoulos.
Views: 48 Microsoft Research
Understand the Blockchain in Two Minutes
 
02:26
Over the past decade, an alternative digital paradigm has slowly been taking shape at the edges of the internet. This new paradigm is the blockchain. After incubating through millions of Bitcoin transactions and a host of developer projects, it is now on the tips of tongues of CEOs and CTOs, startup entrepreneurs, and even governance activists. Though these stakeholders are beginning to understand the disruptive potential of blockchain technology and are experimenting with its most promising applications, few have asked a more fundamental question: What will a world driven by blockchains look like a decade from now? Learn more: http://www.iftf.org/blockchainfutureslab Contact us: http://www.iftf.org/blockchainfutureslab/contact
Internship in France with EGE
 
01:40
EUROASIA GLOBAL EDUCATION - Our main mission is to promote student exchanges between Asia and Europe and to help students to benefit from study opportunities to develop their international skills.This mission is articulated around the organization of Culltural exchange programs, language courses, internships in foreign countries and academic exchanges. EGE is the first company to support international exchanges especially between Asian and European countries. OUR MAIN PROGRAMS Internship abroad: France, Australia, Vietnam , China, Japon, Korea Cultural Exchange: UK, France, Germany, Holland, Spain,Australia, Vietnam , China, Japon Academic Exchange: France, Vietnam Summer Program: France, China,Japon EUROASIA GLOBAL EDUCATION COMPANY 21 Avenue Le Corbusier 59042 Lille -- France [France] 00 33 3 62 64 77 55 [Vietnam] 08 38.362.099 Website: www.ege-france.com | Mail [email protected]
Views: 547 EGE FRANCE
Paul Papas & Matt Candy, IBM | IBM Think 2018
 
20:41
Paul Papas, Global Leader, Digital Strategy and IBM iX, and Matt Candy, European Leader, IBM iX sit down with John Furrier on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.
Chinese hackers hit US firms linked to South China Sea
 
03:42
Chinese hackers hit US firms linked to South China Sea SUBSCRIBE my channel here: https://goo.gl/F8gn4Z URL video: http://www.taipeitimes.com/News/front/archives/2018/03/17/2003689451 G+ here: https://goo.gl/UzMJVe ---------------------------------------------------------------------------------------------------- Chinese hackers have launched a wave of cyberattacks on mainly US engineering and defense companies linked to the disputed South China Sea, cybersecurity firm FireEye said. A suspected Chinese cyberespionage group dubbed TEMP.Periscope appears to be seeking information that would benefit the Chinese government, the US-based provider of network protection systems said. The hackers have focused on US maritime entities that were either linked to — or have clients operating in — the South China Sea, FireEye senior analyst Fred Plan said in Los Angeles.“They are going after data that can be used strategically, so it is line with state espionage,” said Plan, whose firm has tracked the group since 2013. “A private entity probably wouldn’t benefit from the sort of data that is being stolen.”The TEMP.Periscope hackers have been seeking information in areas such as radar range or how precisely a system in development could detect activity at sea, Plan said. The surge in attacks picked up pace last month and is ongoing, he added. While FireEye traced the group’s attacks to China, the firm has not confirmed any link to Chinese government entities or facilities. FireEye declined to name any targets. Although most were based in the US, organizations in Europe and at least one in Hong Kong were also affected, the firm said. Chinese Ministry of Foreign Affairs spokesman Lu Kang (陸慷) yesterday told a briefing in Beijing that China opposed all kinds of cyberattacks.“We will continue to implement the important consensus on cybersecurity reached in 2015,” he said. The number of suspected Chinese cyberattacks on US targets has picked up over the past few months, after both sides agreed not to attack civilian entities, Plan said. The 2015 deal to tamp down economic espionage was hammered out by then-US president Barack Obama and Chinese President Xi Jinping (習近平).The US indicted five Chi... ----------------------------------------------------------------------------------------------------
Views: 373 Hot News
Experimental Studies on a Single Microtubule (Google Workshop on Quantum Biology)
 
45:59
Google Workshop on Quantum Biology Experimental Studies on a Single Microtubule: Investigation of Electronic Transport Properties Presented by Anirban Bandyopadhyay October 22, 2010 ABSTRACT Using nanotechnology we have studied electronic transport properties of a single microtubule (MT) under direct current/bias (DC) and alternating current (AC) of varying frequencies. Our study ranged from 10 K to the room temperature. At specific, 1) spontaneous MT growth under AC signal that led to Froelich Condensation, 2) ballistic electronic transport under DC and AC signal, 3) ferroelectric MT properties under DC signal. Applications of MT as a multilevel information processing and memory device (beyond binary logic) will be discussed. I will present our rigorous study to unravel the origin of room temperature coherent transport in terms of band energy diagrams where point contacts between valence and conduction band triggers transport of electrons/quasi particles. Finally, I will describe challenges and resolution of detection of MT topological qubits based on Hemchandra/Fibonacci MT geometry at physiological temperature. About the speaker: Dr. Anirban Bandyopadhyay completed his doctorate in supramolecular electronics at IACS, Kolkata, India, in 2005. He is a permanent scientist in NIMS, Tsukuba Japan. In 2008, he and his colleagues invented nano brain an artificial molecular processor that mimics a fundamental hardware feature of our neural network. Apart from holding executive positions in particular scientific organizations and editorial board of information related journals, he is involved in setting up a global platform for creating a super-intelligent molecular machine "Bramha". For details about his works, and publications please visit www.anirbanlab.co.nr
Views: 14315 GoogleTechTalks
Mohammed Farooq, IBM | IBM Think 2018
 
19:27
Mohammad Farooq, GM, Brokerage Services, GTS at IBM, sits down with Dave Vellante and Peter Burris on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.
Efficient Ring Signatures in the Standard Model
 
24:15
Paper by Giulio Malavolta and Dominique Schröder, presented at Asiacrypt 2017. See https://www.iacr.org/cryptodb/data/paper.php?pubkey=28262
Views: 191 TheIACR
Nathan Weibe seminar - Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
 
59:22
We develop a method for approximate synthesis of single--qubit rotations of the form e^{-i f(\phi_1,\ldots,\phi_k)X} that is based on the Repeat-Until-Success (RUS) framework for quantum circuit synthesis. We demonstrate how smooth computable functions, f, can be synthesized from two basic primitives. This synthesis approach constitutes a manifestly quantum form of arithmetic that differs greatly from the approaches commonly used in quantum algorithms. The key advantage of our approach is that it requires far fewer qubits than existing approaches: as a case in point, we show that using as few as 3 ancilla qubits, one can obtain RUS circuits for approximate multiplication and reciprocals. We also analyze the costs of performing multiplication and inversion on a quantum computer using conventional approaches and find that they can require too many qubits to execute on a small quantum computer, unlike our approach.
WACV18: Tutorial: Part 2: When Blockchain Meets Computer Vision: Opportunities and Challenges
 
15:10
Organizers: Karthik Nandakumar, Sharathchandra Pankanti, Nalini Ratha (IBM Singapore Lab; IBM Thomas J. Watson Research Center) Description: It is widely acknowledged that blockchain is foundational technology that will revolutionize the way transactions are conceived, executed, managed, and monetized. While the technological benefits of the blockchain infrastructure are imminent, the underlying technological problems need significant attention from researchers. Of specific interest to computer vision researchers and application developers is the opportunity to make a connection to these emerging infrastructure capabilities, and realize how their skills can be leveraged to make an impact. As the camera-based infrastructure is becoming ubiquitous and compute power is becoming pervasively available, the business world is going to look to camera as a default sensor, and camera-based analytics as a de facto information channel to improve the integrity of transactions. For instance, many complex practical challenges such as usability, compliance with regulations, integrity of transaction artifacts, and protecting privacy of sensitive information, can be effectively addressed using blockchain technology. The tutorial is aimed as a gentle introduction to the broader world of distributed transaction environment, and specifically blockchain technology. The tutorial will first introduce the blockchain technical concepts and capabilities in the context of real computer vision applications. The tutorial will subsequently review real application scenarios, where blockchain has tremendous potential to accelerate its use as an enterprise transaction infrastructure. The key technical challenges will be concretely couched in real mainstream use-cases such video surveillance and would cover many important aspects such privacy of end-users, scalability and cost-effectiveness, and user friendliness. Solving these problems requires multi-disciplinary research effort at the intersection of blockchain, artificial intelligence, and user behavior modeling.
Austin Fowler:  Why and how should we build a quantum computer?
 
01:08:57
IQC visitor and UCSB researcher Austin Fowler describes the current state of knowledge on how to build a practical quantum computer. Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Machines of Loving Grace: A Symposium on AI, Architecture and Virtual Worlds (session 2)
 
01:28:48
MACHINES OF LOVING GRACE: A SYMPOSIUM ON AI, ARCHITECTURE AND VIRTUAL WORLDS Session 2 Popularly labeled as the 4th Industrial Revolution, the proliferation of artificial intelligence, robotics, automation and virtual reality is transforming the socioeconomic structure of our society and consequently revolutionizing the way we design and experience spaces. These emerging technological paradigms promise a heightened sense of interaction between humans and their environment. In these new scenarios, the software and hardware ecosystems are exceedingly gaining autonomy. Virtual worlds are no longer limited to be interfaces that merely enhance the physical environment but are becoming spaces in their own right; blurring the distinction between the physical and the digital in our constructed reality. The Symposium: Machines of Loving Grace expands the contemporary discussion on the evolution of human-machine society into the domain of architectural discourse. Focusing on these new design ecosystems that shape our contemporary reality, the presenters will explore the particular themes of artificial intelligence, interaction design, and virtual/ augmented reality. Some of the main discussion points will include: -AI and intelligent environments -Interactive spaces and cyberphysical systems - Virtual worlds and architecture of interfaces - Robotics, autonomy, and automation By engaging some of the greatest minds from the fields of art, architecture, philosophy, industrial design, literature and engineering, the symposium will theorize and situate a new agenda for the intersection of technology and the environments we occupy and socialize in; both digitally and physically. Detailed schedule & presenters 1:00 PM-1:30 PM Check in + Exhibition 1:30 PM- 1:55 PM Welcome by Neil Denari, Interim Chair and Professor UCLA A.UD Intro by Guvenc Ozel, Faculty UCLA Suprastudio SESSION 1: AI: Interfaces and Objects 1:55 PM- 2:20 PM Nora Khan, Writer, Rhizome, Eyebeam 2:20 PM- 2:45 PM Kenric McDowell, Senior UX Designer, Google Research, Art and Machine Intelligence 2:45 PM- 3:10 PM Tim Wantland, Senior Interaction Designer, Google Research Machine Intelligence 3:10 PM- 3:30 PM SESSION 1 PANEL DISCUSSION SESSION 2: Form, Data and Intelligence 3:30 PM- 3:55 PM Jason Kelly Johnson, Design Principal, Future Cities Lab & Associate Professor, CCA San Francisco 3:55 PM- 4:20 PM Casey Reas, Professor, UCLA Design Media Arts 4:20 PM- 4:45 PM Nick Cote, Researcher, Applied Research & Innovation, Autodesk 4:45- 5:05 SESSION 2 PANEL DISCUSSION SESSION 3: Cyberphysical Systems: The Virtual and the Physical 5:05 PM- 5:30 PM Benjamin Bratton, Professor, University of California, San Diego, Program Director, Strelka Institute of Media, Architecture and Design in Moscow 5:30 PM- 5:55 PM Jose Sanchez, Assistant Professor University of Southern California, School of Architecture, Director at Plethora Project llc. 5:55 PM- 6:20 PM Rebecca Allen, Professor, UCLA Design Media Arts 6:20 PM- 6:40 PM SESSION 3 PANEL DISCUSSION 6:40 PM- 7:00 PM ALL SPEAKERS, Audience Q&A The Symposium is hosted by Ozel SUPRASTUDIO. ABOUT OZEL SUPRASTUDIO Ozel SUPRASTUDIO at UCLA IDEAS is focused on investigating the intersection of the digital and the physical worlds, looking at the cusp of living in mixed realities where interactive environments challenge traditional fabrication techniques and spatial assemblies. Current research objectives include virtual and augmented reality, robotics, cyberphysical systems and smart space applications. Automation, interaction, autonomous transportation, space travel, robotic fabrication, virtual spaces and interface design are recurring themes of exploration, aiming to find meaningful design applications while navigating through the ever-changing world of technology. Some of the current and former industry collaborations include Autodesk and Microsoft, among others. Studio is led by Guvenc Ozel with the assistance of lecturers Benjamin Ennemoser and Mertcan Buyuksandalyaci. IDEAS LECTURE SERIES The IDEAS Lecture Series charts a dynamic new future for architecture by engaging speakers from a broad range of disciplines. The series looks beyond the field's traditional boundaries and explores topics arising from unexpected quarters—entertainment, automotive, aerospace, and tech industries—in order to explore rapidly emerging new technologies, possibilities for interdisciplinary growth, and the role of Los Angeles in the evolution of architecture.
Sir Anthony Leggett - 2012 Lecture Series Overview
 
01:50
Since 2006, Sir Anthony Leggett has been visiting IQC at the University of Waterloo for an annual twelve part lecture series, dealing with his two main areas of interest, condense matter physics and quantum foundations. With direct connections between his work and the work done at IQC, he explains how the annual lecture series is not just a benefit to IQC, but for him as well. The 2012 lecture series is the first time Sir Anthony Leggett has covered eight separate and distinct topics dealing with quantum science, based on the requests of those in attendance. Leggett was one of three scientists to share the 2003 Nobel Prize in Physics for important contributions to low-temperature physics and superfluidity. He is contracted to spend the next four summers at the Institute for Quantum Computing. He is also the Mike & Ophelia Lazaridis Distinguished Research Chair at IQC. Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Positivity for Curves Lecture
 
01:05:47
AGNES is a series of weekend workshops in algebraic geometry. One of our goals is to introduce graduate students to a broad spectrum of current research in algebraic geometry. AGNES is held twice a year at participating universities in the Northeast. Lecture presented by Brian Lehmann.
Views: 173 Brown University
Random Access in Multiparty Computation
 
43:16
How can two strangers figure out how many phone contacts they have in common without revealing anything else about each other? Can this be done even in the absence of trusted third parties? How about the case of two strangers comparing genetic information to figure out how closely related they are? Many interesting applications have become possible with recent improvements in multiparty computation, and we are working to make it even more efficient and convenient to use. In this talk, we will be focusing on random memory access in secure computation. In other words, we will try to efficiently solve the problem where a program needs to access a memory location without revealing which location is being accessed. The first part will be on specialized circuit structures that allow extremely efficient memory access for any circuit-based protocol (e.g. Yao, GMW), but only if the access pattern follows certain constraints. The second half of the talk will be a new Oblivious RAM construction that allows any arbitrary random access, but is less efficient. Although this problem had been ``solved'' in theory, past solutions only provide asymptotic benefits. They all had exorbitant initialization costs which dwarfed any per-access performance improvement they provided. Our construction provides a 100x improvement in initialization cost, and concrete benefits for as small as 144 bytes of data, inspite of being asymptotically inferior. We hope this will make secure multiparty computation easier to adopt in a greater variety of applications than was reasonable in the past.
Views: 128 Microsoft Research
Role-based access control
 
10:13
In computer systems security, role-based access control (RBAC) is an approach to restricting system access to authorized users. It is used by the majority of enterprises with more than 500 employees, and can implement mandatory access control (MAC) or discretionary access control (DAC). RBAC is sometimes referred to as role-based security. This video is targeted to blind users. Attribution: Article text available under CC-BY-SA Creative Commons image source in video
Views: 6942 Audiopedia
Quantum computer
 
34:56
A quantum computer is a computation device that makes direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses qubits (quantum bits), which can be in superpositions of states. A theoretical model is the quantum Turing machine, also known as the universal quantum computer. Quantum computers share theoretical similarities with non-deterministic and probabilistic computers; one example is the ability to be in more than one state simultaneously. The field of quantum computing was first introduced by Yuri Manin in 1980 and Richard Feynman in 1982. A quantum computer with spins as quantum bits was also formulated for use as a quantum space--time in 1969. As of 2014 quantum computing is still in its infancy but experiments have been carried out in which quantum computational operations were executed on a very small number of qubits. Both practical and theoretical research continues, and many national governments and military funding agencies support quantum computing research to develop quantum computers for both civilian and national security purposes, such as cryptanalysis. This video is targeted to blind users. Attribution: Article text available under CC-BY-SA Creative Commons image source in video
Views: 272 Audiopedia
Dinesh Nirmal, IBM | IBM Think 2018
 
14:32
Dinesh Nirmal, Vice President, Analytics Development, IBM Hybrid Cloud at IBM, sits down with Dave Vellante on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.
Quantum computer
 
31:27
A quantum computer is a computation device that makes direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits , each of which is always in one of two definite states , quantum computation uses qubits , which can be in superpositions of states. A theoretical model is the quantum Turing machine, also known as the universal quantum computer. Quantum computers share theoretical similarities with non-deterministic and probabilistic computers; one example is the ability to be in more than one state simultaneously. The field of quantum computing was first introduced by Yuri Manin in 1980 and Richard Feynman in 1982. A quantum computer with spins as quantum bits was also formulated for use as a quantum space--time in 1969. This video targeted to blind users. Attribution: Article text available under CC-BY-SA Creative Commons image source in video
Views: 490 encyclopediacc
Eric Herzog, IBM | IBM Think 2018
 
15:02
Eric Herzog, CMO & VP of Global Channels, IBM Storage Systems at IBM, sits down with Dave Vellante and Peter Burris on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.
"EFF Confidential!"
 
57:09
Google TechTalks February 9, 2006 Danny O'Brien and Jason Schultz Danny O'Brien Danny O'Brien is the Activism Coordinator for the EFF. His job is to help EFF's membership in making their voice heard: in government and regulatory circles, in the marketplace, and with the wider public. Jason Schultz Jason Schultz is a Staff Attorney specializing in intellectual property and reverse engineering. He currently leads EFF's Patent Busting Project. Prior to joining EFF, Schultz worked at the law firm of Fish & Richardson P.C., where he spent most of his time invalidating software patents and defending open source developers in law suits. Jason maintains a personal blog at...
Views: 1929 Google
Jason Kelley & Gene Chao, IBM | IBM Think 2018
 
17:58
Jason Kelley, General Manager, IBM Blockchain Services at IBM & Gene Chao, Global VP of IBM Automation at IBM, sit down with Dave Vellante and Peter Burris on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.
Field-programmable gate array
 
25:49
A field-programmable gate array (FPGA) is an integrated circuit designed to be configured by a customer or a designer after manufacturing – hence "field-programmable". The FPGA configuration is generally specified using a hardware description language (HDL), similar to that used for an application-specific integrated circuit (ASIC) (circuit diagrams were previously used to specify the configuration, as they were for ASICs, but this is increasingly rare). Contemporary FPGAs have large resources of logic gates and RAM blocks to implement complex digital computations. As FPGA designs employ very fast I/Os and bidirectional data buses it becomes a challenge to verify correct timing of valid data within setup time and hold time. Floor planning enables resources allocation within FPGA to meet these time constraints. FPGAs can be used to implement any logical function that an ASIC could perform. The ability to update the functionality after shipping, partial re-configuration of a portion of the design and the low non-recurring engineering costs relative to an ASIC design (notwithstanding the generally higher unit cost), offer advantages for many applications. This video is targeted to blind users. Attribution: Article text available under CC-BY-SA Creative Commons image source in video
Views: 1655 Audiopedia
Basics of NMR
 
45:43
Views: 419 Quantum Computing
Michelle Boockoff-Bajdek, IBM, & John Bobo, NASCAR | IBM Think 2018
 
14:33
Michelle Boockoff-Bajdek, Head of Global Marketing, Business Solutions at IBM, and John Bobo, Managing Director, Racing Operations at NASCAR, sit down with Dave Vellante on day three of IBM Think 2018 at Mandalay Bay Resort and Casino in Las Vegas, Nevada.