Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Cryptol

Search In Journal Title:

Abbravation: Journal of Cryptology

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1016/0370-2693(79)90514-8

Search In DOI:

ISSN

1432-1378

Search In ISSN:
Search In Title Of Papers:

Handling Expected PolynomialTime Strategies in Si

Authors: Jonathan Katz Yehuda Lindell
Publish Date: 2007/09/28
Volume: 21, Issue: 3, Pages: 303-349
PDF Link

Abstract

The standard class of adversaries considered in cryptography is that of strict polynomialtime probabilistic machines However expected polynomialtime machines are often also considered For example there are many zeroknowledge protocols for which the only known simulation techniques run in expected and not strict polynomial time In addition it has been shown that expected polynomialtime simulation is essential for achieving constantround blackbox zeroknowledge protocols This reliance on expected polynomialtime simulation introduces a number of conceptual and technical difficulties In this paper we develop techniques for dealing with expected polynomialtime adversaries in simulationbased security proofs

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation
  2. Formal Proofs for the Security of Signcryption
  3. Concurrent Knowledge Extraction in Public-Key Models
  4. Jacobian Coordinates on Genus 2 Curves
  5. On the Amortized Complexity of Zero-Knowledge Protocols
  6. On the Efficient Generation of Prime-Order Elliptic Curves
  7. Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
  8. Accelerating Pollard’s Rho Algorithm on Finite Fields
  9. The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
  10. Constant-Round Oblivious Transfer in the Bounded Storage Model
  11. The Discrete Logarithm Problem on Elliptic Curves of Trace One
  12. Short Signatures from Diffie–Hellman: Realizing Almost Compact Public Key
  13. Integral Cryptanalysis on Full MISTY1
  14. Integral Cryptanalysis on Full MISTY1
  15. Universally Composable Symbolic Security Analysis
Search Result: