Home
Search results “Bilinear pairings in cryptographic algorithms”
3rd BIU Winter School on Cryptography:The Basics of Pairings - Dan Boneh
 
01:14:45
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 8013 barilanuniversity
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: 1135 Microsoft Research
3rd BIU Winter School on Cryptography: How Pairings Work - Florian Hess
 
57:30
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 2562 barilanuniversity
3rd BIU Winter School on Cryptography: How pairings work and how to compute them efficiently
 
01:27:12
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 319 barilanuniversity
3rd BIU Winter School on Cryptography: The basics of elliptic curves - Nigel Smart
 
01:20:28
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 5382 barilanuniversity
3rd BIU Winter School on Cryptography: How Pairings Work - Florian Hess
 
01:34:21
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 1117 barilanuniversity
3rd BIU Winter School on Cryptography: Identity-Based Encryption and Variants - Dan Boneh
 
01:25:53
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 6103 barilanuniversity
3rd BIU Winter School on Cryptography: The Discrete Log Problem on Elliptic Curves - Nigel Smart
 
01:15:28
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 1676 barilanuniversity
Structure-Preserving Signatures from Type II Pairings
 
19:05
Structure-Preserving Signatures from Type II Pairings by Masayuki Abe, Miyako Ohkubo, Jens Groth, Mehdi Tibouchi. Talk at Crypto 2014.
Views: 141 TheIACR
3rd BIU Winter School on Cryptography: Applications of Elliptic Curves to Cryptography - Nigel Smart
 
01:14:33
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 1441 barilanuniversity
3rd BIU Winter School on Cryptography: Broadcast encryption and traitor tracing - Dan Boneh
 
59:32
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 1444 barilanuniversity
3rd BIU Winter School on Cryptography: Attribute-Based Encryption - Allison Bishop Lewko
 
01:50:16
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 4331 barilanuniversity
Optimized Identity-Based Encryption from Bilinear Pairing for Lightweight Devices
 
13:39
Optimized Identity-Based Encryption from Bilinear Pairing for Lightweight Devices IEEE PROJECTS 2017-2018 Call Us: +91-7806844441,9994232214 Mail Us: [email protected] Website: http://www.ieeeproject.net : http://www.projectsieee.com : http://www.ieee-projects-chennai.com : http://www.24chennai.com WhatsApp : +91-7806844441 Chat Online: https://goo.gl/p42cQt Support Including Packages ======================= * Complete Source Code * Complete Documentation * Complete Presentation Slides * Flow Diagram * Database File * Screenshots * Execution Procedure * Readme File * Video Tutorials * Supporting Softwares Support Specialization ======================= * 24/7 Support * Ticketing System * Voice Conference * Video On Demand * Remote Connectivity * Document Customization * Live Chat Support
3rd BIU Winter School on Cryptography: Functional Encryption - Allison Bishop Lewko
 
52:01
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 1655 barilanuniversity
3rd BIU Winter School on Cryptography: Non-interactive Zero Knowledge - Jens Groth
 
49:52
The 3rd Bar-Ilan Winter School on Cryptography: Bilinear Pairings in Cryptography, which was held between February 4th - 7th, 2013. The event's program: http://crypto.biu.ac.il/winterschool2013/schedule2013.pdf For All 2013 Winter school Lectures: http://www.youtube.com/playlist?list=PLXF_IJaFk-9C4p3b2tK7H9a9axOm3EtjA&feature=mh_lolz Dept. of Computer Science: http://www.cs.biu.ac.il/ Bar-Ilan University: http://www1.biu.ac.il/indexE.php
Views: 2688 barilanuniversity
Decentralizing Attribute-Based Encryption
 
01:05:50
We present a Multi-Authority Attribute-Based Encryption (ABE) system. In our system, any party can become an authority and there is no requirement for any global coordination other than the creation of an initial set of common reference parameters. A party can simply act as an ABE authority by creating a public key and issuing private keys to different users that reflect their attributes. A user can encrypt data in terms of any boolean formula over attributes issued from any chosen set of authorities. Finally, our system does not require any central authority. In this talk, I will present our system and discuss its proof, which employs dual system encryption techniques. Our system uses bilinear groups of composite order, and we prove security under static assumptions in the random oracle model. This is joint work with Brent Waters.
Views: 1684 Microsoft Research
Hovav Shacham (University of California) / On the Generic Group Model in Pairing-Based Cryptography
 
01:02:32
2010 International Workshop on Mathematical Cryptology 2010-08-27
Views: 75 Mathnet Korea
Identity Based Encryption from the Diffie Hellman Assumption
 
27:39
Paper by Nico Döttling and Sanjam Garg, presented at Crypto 2017. See https://iacr.org/cryptodb/data/paper.php?pubkey=28232
Views: 1806 TheIACR
SF Bitcoin Devs Seminar: Cryptography Methods to Guarantee Payment Anonymity
 
47:17
Talk will be about how these concepts work in guaranteeing anonymous payments • Blind signatures • One-way accumulators • Zero-knowledge proofs • Ring signatures (They are used in coins like ZeroCoin, Monero etc)
Views: 328 Taariq Lewis
Optimized Identity-based Encryption From Bilinear Pairing For Lightweight Devices
 
00:14
Optimized Identity-based Encryption From Bilinear Pairing For Lightweight Devices -IEEE PROJECTS 2017-2018 HOME PAGE : http://www.micansinfotech.com/index.html CSE VIDEOS : http://www.micansinfotech.com/VIDEOS-2017-2018.html ANDROID VIDEOS : http://www.micansinfotech.com/VIDEOS-ANDROID-2017-2018.html PHP VIDEOS : http://www.micansinfotech.com/VIDEOS-APPLICATION-PROJECT-2017-2018#PHP APPLICATION VIDEOS : http://www.micansinfotech.com/VIDEOS-APPLICATION-PROJECT-2017-2018.html CSE IEEE TITLES : http://www.micansinfotech.com/IEEE-PROJECTS-CSE-2017-2018.html EEE TITLES : http://www.micansinfotech.com/IEEE-PROJECTS-POWERELECTRONICS-2017-2018.html MECHANICAL TITLES : http://www.micansinfotech.com/IEEE-PROJECTS-MECHANICAL-FABRICATION-2017-2018.html CONTACT US : http://www.micansinfotech.com/CONTACT-US.html MICANS INFOTECH offers Projects in CSE ,IT, EEE, ECE, MECH , MCA. MPHIL , BSC, in various domains JAVA ,PHP, DOT NET , ANDROID , MATLAB , NS2 , EMBEDDED , VLSI , APPLICATION PROJECTS , IEEE PROJECTS. CALL : +91 90036 28940 +91 94435 11725 [email protected] WWW.MICANSINFOTECH.COM Output Videos… IEEE PROJECTS: https://www.youtube.com/channel/UCTgs... NS2 PROJECTS: https://www.youtube.com/channel/UCS-G... NS3 PROJECTS: https://www.youtube.com/channel/UCBzm... MATLAB PROJECTS: https://www.youtube.com/channel/UCK0Z... VLSI PROJECTS: https://www.youtube.com/channel/UCe0t... IEEE JAVA PROJECTS: https://www.youtube.com/channel/UCSCm... IEEE DOTNET PROJECTS: https://www.youtube.com/channel/UCSCm... APPLICATION PROJECTS: https://www.youtube.com/channel/UCVO9... PHP PROJECTS: https://www.youtube.com/channel/UCVO9... Micans Projects: https://www.youtube.com/user/MICANSIN...
Hierarchical Identity Based Encryption from Affine Messafe Authentication
 
18:04
Presentation at Crypto 2014. Paper by Olivier Blazy and Eike Kiltz and Jiaxin Pan. http://www.iacr.org/cryptodb/data/paper.php?pubkey=25179
Views: 1111 TheIACR
What is ID-BASED CRYPTOGRAPHY? What does ID-BASED CRYPTOGRAPHY mean? ID-BASED CRYPTOGRAPHY meaning
 
03:31
What is ID-BASED CRYPTOGRAPHY? What does ID-BASED CRYPTOGRAPHY mean? ID-BASED CRYPTOGRAPHY meaning - ID-BASED CRYPTOGRAPHY definition - ID-BASED CRYPTOGRAPHY explanation. Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license. SUBSCRIBE to our Google Earth flights channel - https://www.youtube.com/channel/UC6UuCPh7GrXznZi0Hz2YQnQ Identity-based cryptography is a type of public-key cryptography in which a publicly known string representing an individual or organization is used as a public key. The public string could include an email address, domain name, or a physical IP address. The first implementation of identity-based signatures and an email-address based public-key infrastructure (PKI) was developed by Adi Shamir in 1984, which allowed users to verify digital signatures using only public information such as the user's identifier. Under Shamir's scheme, a trusted third party would deliver the private key to the user after verification of the user's identity, with verification essentially the same as that required for issuing a certificate in a typical PKI. Shamir similarly proposed identity-based encryption, which appeared particularly attractive since there was no need to acquire an identity's public key prior to encryption. However, he was unable to come up with a concrete solution, and identity-based encryption remained an open problem for many years. The first practical implementations were finally devised by Sakai in 2000, and Boneh and Franklin in 2001. These solutions were based on bilinear pairings. Also in 2001, a solution was developed independently by Clifford Cocks. Identity-based systems allow any party to generate a public key from a known identity value such as an ASCII string. A trusted third party, called the private key generator (PKG), generates the corresponding private keys. To operate, the PKG first publishes a master public key, and retains the corresponding master private key (referred to as master key). Given the master public key, any party can compute a public key corresponding to the identity ID by combining the master public key with the identity value. To obtain a corresponding private key, the party authorized to use the identity ID contacts the PKG, which uses the master private key to generate the private key for identity ID. Identity-based systems have a characteristic problem in operation. Suppose Alice and Bob are users of such a system. Since the information needed to find Alice's public key is completely determined by Alice's ID and the master public key, it is not possible to revoke Alice's credentials and issue new credentials without either (a) changing Alice's ID (usually a phone number or an email address which will appear in a corporate directory); or (b) changing the master public key and re-issusing private keys to all users, including Bob. This limitation may be overcome by including a time component (e.g. the current month) in the identity.
Views: 330 The Audiopedia
Secure and Efficient Handover Authentication Based on Bilinear Pairing Functions
 
02:57
Gagner Technologies offer this project.This project has five modules. This project based on IEEE transactions 2012. Contact: Gagner Technologies, #7 police quarters Road(Behnid Bus T.Nagar Bus Satnd), T.Nagar, Chennai-17,web:www.gagner.in mail:[email protected] call to: 9092820515
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
 
16:03
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications by Goichiro Hanaoka, Noboru Kunihiro, Takashi Yamakawa, Shota Yamada. Talk at Crypto 2014.
Views: 732 TheIACR
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
 
17:00
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups by Masayuki Abe, Miyako Ohkubo, Jens Groth, Takeya Tango. Talk at Crypto 2014.
Views: 359 TheIACR
An Efficient And Secure Dynamic Auditing Protocol For Data Storage in Cloud Computing
 
09:05
To solve the data privacy problem, an encrypted proof with the challenge stamp by using the Bilinearity property of the bilinear pairing is generated, such that the auditor cannot decrypt it but can verify the correctness of the proof. Without using the mask technique, it does not require any trusted organizer during the batch auditing for multiple clouds. On the other hand, the server compute the proof as an intermediate value of the verification, such that the auditor can directly use this intermediate value to verify the correctness of the proof. Therefore, this can greatly reduce the computing loads of the auditor by moving it to the cloud server.
Views: 273 Amala ARmen
Id Based digital Signature using NS2 Simulation | NS2 Projects
 
01:17
Digital signatures are among the most basic primitives in cryptography, providing authenticity, integrity, and non-repudiation in an asymmetric setting. https://ns2projects.org Concepts involved in ID-based digital signature: • Message recovery process • Hierarchical identity based encryption • Instantiations • Certification approach • Identity-Based Signatures with Special Properties • Bilinear pairing • Cost of signature algorithms • Embedding • Modular exponentiation • Elliptic scalar multiplication • Key generation • Signature generation • Signature verification • To reduce time complexity • To improve performance of the system • factoring and discrete logarithms • achieving efficiency and security of system
Views: 366 NS2 Projects
IBE 3.0 IoT Demo
 
04:00
A demonstration of key exchange, authentication and AES encryption of weather observation data using Identity Based Encryption (IBE) 3.0. ConnectInPrivate.com
Views: 106 CIP Administrator
CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.
 
17:29
Talk at pkc 2010. Authors: Toshihide Matsuda, Ryo Nishimaki, Keisuke Tanaka. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23414
Views: 494 TheIACR
Cryptography techniques by DR. C. Rama Krishna on 19th november 2013
 
01:35:29
Cryptography techniques by DR. C. Rama Krishna on 19th november 2013
Views: Nitttrchd
5. BLS aggregation by Vitalik Buterin and Justin Drake (Ethereum Foundation)
 
27:43
The Ethereum Sharding Meeting #2 - Berlin 5. BLS aggregation by Vitalik Buterin and Justin Drake (Ethereum Foundation) Resources: https://notes.ethereum.org/s/B1-7aivmX --- Video: Anton Tal @antontal Audio: Matteo Tambussi @matlemad Producer: Chris Hobcroft @chrishobcroft Executive Producer: Doug Petkanics @petkanics For @livepeertv on behalf of @LivepeerOrg
Views: 415 Ethereum Foundation
Elliptic curve cryptography
 
18:25
Elliptic curve cryptography is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. One of the main benefits in comparison with non-ECC cryptography is the same level of security provided by keys of smaller size. Elliptic curves are applicable for encryption, digital signatures, pseudo-random generators and other tasks. They are also used in several integer factorization algorithms that have applications in cryptography, such as Lenstra elliptic curve factorization. This video is targeted to blind users. Attribution: Article text available under CC-BY-SA Creative Commons image source in video
Views: 2863 Audiopedia
Attribute based access control with constant-size ciphertext in cloud computing
 
11:41
With the popularity of cloud computing, there have been increasing concerns about its security and privacy. Since the cloud computing environment is distributed and untrusted, data owners have to encrypt outsourced data to enforce confidentiality. Therefore, how to achieve practicable access control of encrypted data in an untrusted environment is an urgent issue that needs to be solved. Attribute-Based Encryption (ABE) is a promising scheme suitable for access control in cloud storage systems. This paper proposes a hierarchical attribute-based access control scheme with constant-size ciphertext. The scheme is efficient because the length of ciphertext and the number of bilinear pairing evaluations to a constant are fixed. Its computation cost in encryption and decryption algorithms is low. Moreover, the hierarchical authorization structure of our scheme reduces the burden and risk of a single authority scenario. We prove the scheme is of CCA2 security under the decisional q-Bilinear Diffie-Hellman Exponent assumption. In addition, we implement our scheme and analyse its performance. The analysis results show the proposed scheme is efficient, scalable, and fine-grained in dealing with access control for outsourced data in cloud computing. To get the source code contact 9003628940 [email protected]
Views: 36 IEEE PROJECTS
Faster Computation of the Tate Pairing
 
03:39
Christophe Arene, *Tanja Lange, Michael Naehrig, Christophe Ritzenthaler *Department of Mathematics and Computer Science Technische Universiteit Eindhoven P.O. Box 513, 5600 MB Eindhoven Netherlands Email: [email protected] Manuscript number: JNT-D-09-00332R1
Views: 1851 JournalNumberTheory
Faster Pairing Computations on Curves with High-Degree Twists.
 
26:05
Talk at pkc 2010. Authors: Craig Costello, Tanja Lange, Michael Naehrig. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23413
Views: 238 TheIACR
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
 
01:21
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: [email protected], web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com ABSTRACT: Traditional broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.
Views: 531 jpinfotechprojects
On the cryptographic hardness of finding a Nash equilibrium - Nir Bitansky
 
01:03:50
The computational complexity of finding Nash Equilibria in games has received much attention over the past two decades due to its theoretical and philosophical significance. This talk will be centered around the connection between this problem and cryptography. Mostly, I will discuss a result proving that finding Nash equilibrium is hard, assuming the existence of a cryptographic notion called indistinguishability obfuscation. This is done by demonstrating that this cryptographic notion gives rise to a hard computational problem in the complexity class PPAD, for which finding Nash equilibrium is known to be complete. Indeed, in recent years indistinguishability obfuscation has turned out to have surprisingly strong implications in cryptography and beyond. I will give the high-level picture as to where we stand in our efforts of constructing such obfuscators and basing them on solid hardness assumptions. In a companion talk on Tuesday, I will discuss one specific line of work that reduces indistinguishability obfuscation to simple assumptions on 5-linear maps, coming closer to well-studied cryptographic objects such as bilinear-map groups. The talk is based on joint work with Paneth and Rosen. No prior knowledge in cryptography is required. More videos on http://video.ias.edu
Seminario de Cómputo Científico - 03nov2016
 
01:19:33
The end of paring based cryptography using small characteristic finite fields. Gora Adj Abstract A necessary condition for the security of a cryptosystem based on bilinear pairings over elliptic or hyperelliptic curves is that the discrete logarithm problem in the subjacent curve subgroups and the finite field subgroup must be hard. In recent years, there have been several dramatic improvements in algorithms for computing discrete logarithms in small characteristic finite fields, that consequently placed the security of the small-characteristic pairing-based cryptography in a state of uncertainty. In this talk, we will discuss these new algorithms and tell how they drastically impact the security of cryptosystems based on pairings that utilize finite fields of small characteristic. Plática dictada por el profesor Gora Adj del Departamento de Ciencias de la Computación, Cinvestav-IPN, dentro del Seminario de Cómputo Científico el día 3 de noviembre de 2016. Para más información visite la página del Laboratorio de Cómputo Científico: http://tikhonov.fciencias.unam.mx/
Identity-Based (Lossy) Trapdoor Functions and Applications.
 
23:58
Talk at eurocrypt 2012. Authors: Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=24244
Views: 1177 TheIACR
New and Improved Key-Homomorphic Pseudorandom Functions
 
18:19
New and Improved Key-Homomorphic Pseudorandom Functions by Chris Peikert, Abhishek Banerjee. Talk at Crypto 2014.
Views: 370 TheIACR
Automated Analysis of Cryptographic Assumptions in Generic Group Models
 
17:51
Automated Analysis of Cryptographic Assumptions in Generic Group Models by John C. Mitchell, Andre Scedrov, Dario Fiore, Gilles Barthe, Edvard Fagerholm, Benedikt Schmidt. Talk at Crypto 2014.
Views: 208 TheIACR
Inside UCL Info Sec: Prof Jens Groth
 
04:27
Prof Jens Groth discusses his areas of research: cryptography and zero-knowledge proofs. See more about our MSc Information Security here http://www.cs.ucl.ac.uk/degrees/msc_isec/
Views: 936 UCLComputerScience
Identity-Based Aggregate and Multi-Signature Schemes Based on RSA.
 
26:19
Talk at pkc 2010. Authors: Stanislaw Jarecki, Ali Bagherzandi. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=23402
Views: 504 TheIACR
Identity-Based Distributed Provable Data Possession in Multicloud Storage
 
00:55
Identity-Based Distributed Provable Data Possession in Multicloud Storage To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: [email protected], web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Remote data integrity checking is of crucial importance in cloud storage. It can make the clients verify whether their outsourced data is kept intact without downloading the whole data. In some application scenarios, the clients have to store their data on multicloud servers. At the same time, the integrity checking protocol must be efficient in order to save the verifier’s cost. From the two points, we propose a novel remote data integrity checking model: ID-DPDP (identity-based distributed provable data possession) in multicloud storage. The formal system model and security model are given. Based on the bilinear pairings, a concrete ID-DPDP protocol is designed. The proposed ID-DPDP protocol is provably secure under the hardness assumption of the standard CDH (computational Diffie-Hellman) problem. In addition to the structural advantage of elimination of certificate management, our ID-DPDP protocol is also efficient and flexible. Based on the client’s authorization, the proposed ID-DPDP protocol can realize private verification, delegated verification, and public verification.
Views: 125 jpinfotechprojects
Constant-round interactive-proofs for delegating computations (continued) - Rothblum
 
01:39:10
Computer Science/Discrete Mathematics Seminar II Topic: Constant-round interactive-proofs for delegating computations (continued) Speaker: Ron Rothblum Date: Tuesday, February 2 We will continue Monday's talk on constant-round interactive proofs, going into more details of the full construction and its proof. We will also briefly recap Monday's talk so that it will be beneficial to those who cannot attend on Monday. For more videos, visit http://video.ias.edu