Very clearly explained. Easy to understand. Thank you very much!
@Tommy-oj4hd5 жыл бұрын
2:05 - You got it wrong. Why does the User1 needs to use his private key to encrypt the message? In the PK cryptography, encrypting is done using the receiver's public key. Perhaps you've confused signing a message with encrypting the message?
@robfielding85664 жыл бұрын
he's not specifying which system he is encrypting with. in RSA, an encrypt with private key is a signature. the stuff he is doing with id/salt looks different. i am going to not judge it yet. attribute-based-encryption (cp-abe) is what led me here.
@robfielding85664 жыл бұрын
9:00 is very similar to where I ended up as well. There is a way to do things like ((a and c) or d) to allow for key calculation. My problem was that no matter how I attacked it, I could take my attributes (a,b,d) for myself, and collude with another certificate holder that had (e,c) to forge access to ((a and c) or d). The trick is to somehow watermark all attributes as being from the same certificate; so that users cannot combine them. This is actually hard; and probably involves Elliptic Curve Pairings to make it work. The easy part is representing it as an OR of AND circuit. The hard part is making sure that there are no intermediate steps that let a malicious pair of certificate owners to get access to an intermediate step to combine attributes from different certs. What is this useful for? It's for things like issuing badges that can decrypt any file (encrypted in the future or the past) where the boolean circuit holds. Things like encrypting files to security clearances, etc. The other hard part is to encode UNBOUNDED attributes. A small set, such as numbers from 0..1000 to encode access is easier. But there are a large number of email addresses, so you can't enumerate them.
@robfielding85664 жыл бұрын
Shah Quadri ... specifically what crypto primitives did you use? I can't figure out curve pairings. I can do simple demos of the concept using hashes, and RSA .... but both of them fall to attacks on the intermedicate steps. Usually due to something akin to multiplication distributing over addition.
@venkatpalivela95114 жыл бұрын
Hi Shah ,i'm very new to this topic and requirements for the temporarily solution came here, i'm very happy to understand topic thank you for uploaded ..:)
@alekyayyenduri69614 жыл бұрын
Very good explanation sir Thanks for making a video
@subashj64214 жыл бұрын
very clear explanation
@dr.j.joshuadanielraj96706 жыл бұрын
hi can you explain the mathematical concepts related to the implementation of CP-ABE
@mohammedirfan72705 жыл бұрын
Tq very good explanation
@dspatnaik15 жыл бұрын
Well explained...
@NewHope185 жыл бұрын
Good explained
@drn74815 жыл бұрын
Why would my antenna tv channel be encrypted
@prajoyvb4 жыл бұрын
Hello sir I wanted to know the size of plaintext, key and ciphertext of KP-ABE algorithm
@deepikadhamija45484 жыл бұрын
You haven't explained why they are collusion resistance which means if multiple users combine their attributes they can't decrypt the ciphertext
@jenebamary78995 жыл бұрын
explanation to identity based encryption
@chandk79225 жыл бұрын
Plz give the java code implementation for Cp ABE.. Its my project