Score:0

Are there any schemes for support time-limited decryption that are not based on P2P or TTP models?

us flag

Time-lock encryption is a method to encrypt a message such that it can only be decrypted after a certain deadline has passed.

This sounds like time-lock decryption. I was wondering if the inverse with respect to time variable is possible, something like time-limited decryption? Of course if something is encrypted with some key, the key will never expire and will always be able to decrypt the message, e.g. there is no time restriction on this property $Pr[Dec_k(Enc_k(m)) = m] = 1$ which all ciphers have.

I know this functionality is supported by most well-known Instant Messengers today, but from my understanding they require either peer to peer or a trusted third party.

Now I'm questioning, are there any proposed schemes in bibliography that are not based either on P2P or TTP models?

Thanks, in advance, for your time.

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.