Cryptography and cryptographic protocols

DOI10.1007/S00446-002-0077-1zbMATH Open1448.94199OpenAlexW2052054442MaRDI QIDQ5138490FDOQ5138490

Oded Goldreich

Publication date: 4 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-002-0077-1

zbMATH Keywords

cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic encryption
• A method for obtaining digital signatures and public-key cryptosystems
• How to share a secret
• Communication Theory of Secrecy Systems*
• New directions in cryptography
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Bit commitment using pseudorandomness
• Security and composition of multiparty cryptographic protocols
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Foundations of Cryptography
• Nonmalleable Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• A Zero-One Law for Boolean Privacy
• Player simulation and general adversary structures in perfect multiparty computation
• Definitions and properties of zero-knowledge proof systems
• Authenticated Algorithms for Byzantine Agreement
• Keying Hash Functions for Message Authentication
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• The Knowledge Complexity of Interactive Proof Systems
• Complete characterization of security notions for probabilistic private-key encryption
• Perfectly secure message transmission
• How to withstand mobile virus attacks (extended abstract)
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Noninteractive Zero-Knowledge
• Asynchronous secure computation
• Communication preserving protocols for secure function evaluation
• Universally composable two-party and multi-party secure computation
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Asynchronous secure computations with optimal resilience (extended abstract)
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• A uniform-complexity treatment of encryption and zero-knowledge

Cited In (4)

• The meeting businessmen problem: requirements and limitations
• Title not available (Why is that?)
• Cryptographic Protocol Explication and End-Point Projection
• General composition and universal composability in secure multiparty computation

This page was built for publication: Cryptography and cryptographic protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138490)