Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IJNSEC
2008

favoriteEmaildiscussreport

81views more IJNSEC 2008»

Comparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability

13 years 4 months ago

Comparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability

Download ijns.femto.com.tw

Ali Bagherzandi, Javad Mohajeri, Mahmoud Salmasiza

Real-time Traffic

IJNSEC 2008 |

claim paper

Related Content

» Program Analysis Probably Counts

» RDS Remote Distributed Scheme for Protecting Mobile Agents

» ANDOR MultiValued Decision Diagrams AOMDDs for Graphical Models

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IJNSEC
Authors	Ali Bagherzandi, Javad Mohajeri, Mahmoud Salmasizadeh

Comments (0)