Sciweavers

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

96

Voted

CCS
1993
ACM

97views Security Privacy» more CCS 1993»

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

15 years 6 months ago

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

Download cseweb.ucsd.edu

Mihir Bellare, Phillip Rogaway

Real-time Traffic

CCS 1993 | Security Privacy |

claim paper

Related Content

» Implementing TwoParty Computation Efficiently with Security Against Malicious Adversaries

» An Efficient Protocol for Secure TwoParty Computation in the Presence of Malicious Adversa...

» Securing Threshold Cryptosystems against Chosen Ciphertext Attack

» Practical leakageresilient pseudorandom generators

» SimulationSound NIZK Proofs for a Practical Language and Constant Size Group Signatures

» Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction withou...

» Efficient Authentication for Reactive Routing Protocols

» Efficient OneRound Key Exchange in the Standard Model

» Practical Compact ECash

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	CCS
Authors	Mihir Bellare, Phillip Rogaway

Comments (0)