Sciweavers

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

14

CRYPTO
2007
Springer

favoriteEmaildiscussreport

110views Cryptology» more CRYPTO 2007»

Cryptography in the Multi-string Model

13 years 10 months ago

Cryptography in the Multi-string Model

Download www.brics.dk

The common random string model introduced by Blum, Feldman and Micali permits the construction of cryptographic protocols that are provably impossible to realize in the standard model. We can think of this model as a trusted party generating a random string and giving it to all parties in the protocol.

Jens Groth, Rafail Ostrovsky

Real-time Traffic

CRYPTO 2007 | Cryptographic Protocols | Random String Model | Standard Model |

claim paper

Related Content

» Resettable Cryptography in Constant Rounds The Case of Zero Knowledge

» A Provably Secure Proxy Signature Scheme in Certificateless Cryptography

» A JCABased Implementation Framework for Threshold Cryptography

» Gaussian Mixture Models for HigherOrder Side Channel Analysis

» An Analytical Model for TimeDriven Cache Attacks

» Practical Time Capsule Signatures in the Standard Model from Bilinear Maps

» An Uninstantiable RandomOracleModel Scheme for a HybridEncryption Problem

» Simulatable certificateless twoparty authenticated key agreement protocol

» An Economical Model for the Risk Evaluation of DoS Vulnerabilities in Cryptography Protoco...

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	CRYPTO
Authors	Jens Groth, Rafail Ostrovsky

Comments (0)