Forums: » Register « |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support |

#1
October 14th, 2012, 09:46 PM
 lyremlles001
Registered User

Join Date: Oct 2012
Posts: 1
Time spent in forums: 7 m 51 sec
Reputation Power: 0
Crypto Algorithm Question - Perfect Secrecy

I'm not sure where to start this problem:
Consider the following definition of perfect secrecy for the en- cryption of two messages. An encryption scheme (Gen, Enc, Dec) over a message space M is perfectly-secret for two messages if for all distributions over M, all m,m′ ∈M, and all c,c′ ∈C with Pr[C=c∧C′ =c′]>0:
Pr[M=m∧M′ =m′ |C=c∧C′ =c′]=Pr[M=m∧M′ =m′ |M̸=M′],
where m and m′ are sampled independently from the same distribution over M. Show an encryption scheme that provably satisfies this definition. How long are the keys in terms of the length of a message?
Hint. The encryption scheme you propose need not be “efficient”.
ANY help would be great!

#2
October 14th, 2012, 11:42 PM
 E-Oreo
Lost in code

Join Date: Dec 2004
Posts: 8,057
Time spent in forums: 2 Months 1 Day 6 h 4 m 32 sec
Reputation Power: 7104
__________________
PHP FAQ
How to program a basic, secure login system using PHP

Quote:
 Originally Posted by Spad Ah USB, the only rectangular connector where you have to make 3 attempts before you get it the right way around

#3
October 17th, 2012, 11:08 AM
 MauroEldritch
Contributing User

Join Date: Oct 2012
Location: Buenos Aires, Argentina
Posts: 64
Time spent in forums: 17 h 36 m 5 sec
Reputation Power: 1

Ever tried to read Paul Syverson's books?

Or Roger Dingledine's.

 Viewing: Dev Shed Forums > System Administration > Security and Cryptography > Crypto Algorithm Question - Perfect Secrecy