Is there any good paper or research carried out till now that a data is encrypted by a single key or onwer(user) and their are 2 or more decryption keys. One key can decrypt the entire data. Other keys decrypt partial data or a portion of data. A person having no key cannot decrypt the data but those having keys can fully or partially decrypt data based on the keys. ?
This can be solved by the hybrid encryption scheme used by, e.g., PGP.
1. Choose a random "session key" to encrypt the document.
2. For each recipient, encrypt the session key with the receipent's key.
3. Attach the complete set of encrypted session keys to the document
The reciepent keys can be symmetric or asymmetric, depending on the application.
Good question. Dr. Peter has shown a good method for your problem and Dr.martin also done the same. But if I am not wrong you need a three-keys system. so we have private-key and public key systems. However, you need a nother system whih is more than a public key system. If the same encrypted data decrypted with one key you will get an ansewer. However, if you decrypt the data with the third key the result will be different. And both results are true. One result is complete the second is partial. Such system does not exsist for the best of my knowledge. you can trick it as the given methods. To construct this system, start with RSA and modify its steps. May be you will find interesting results
Good luck
Moti's answer to your other question covers it all.
https://www.researchgate.net/post/Is_their_any_symmetric_key_cipher_block_or_stream_cipher_providing_partial_decryption?pli=1&loginT=WjdABDEq2njOxMtLRTkjLBLmOIttHBH_yUVdf1yIz-U&uid=F9j0JBaVyTxS6XxJhTU3zKmbUrFwe1lWOcJJ&cp=re221_ft_j_e1_jp_p93&ch=reg
- Badges
- Science topic