Cryptography and cryptographic protocols

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

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5081837
• scientific article; zbMATH DE number 3965967
• Foundations of Cryptography
• scientific article; zbMATH DE number 1088226
• Security and composition of multiparty cryptographic protocols

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

• Probabilistic encryption
• A method for obtaining digital signatures and public-key cryptosystems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Cryptography
• Nonmalleable Cryptography
• Title not available (Why is that?)
• On the Composition of Zero-Knowledge Proof Systems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete characterization of security notions for probabilistic private-key encryption
• Perfectly secure message transmission
• How to withstand mobile virus attacks (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Noninteractive Zero-Knowledge
• Asynchronous secure computation
• Communication preserving protocols for secure function evaluation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Universally composable two-party and multi-party secure computation
• Title not available (Why is that?)
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\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
• Title not available (Why is that?)
• A uniform-complexity treatment of encryption and zero-knowledge
• Title not available (Why is that?)

Cited In (18)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The meeting businessmen problem: requirements and limitations
• Asymmetric Cryptography
• On the design of cryptographic primitives
• Practical design of two-party cryptographic protocols
• Cryptography between wonderland and underland
• Cryptography meets hardware: selected topics of hardware-based cryptography (invited talk)
• Title not available (Why is that?)
• How to simulate it -- a tutorial on the simulation proof technique
• Cryptographic Protocol Explication and End-Point Projection
• Progress in Cryptology - INDOCRYPT 2004
• General composition and universal composability in secure multiparty computation
• Reducibility among protocols. (Extended abstract)
• Complexity-style resources in cryptography
• Cryptographycal protocols in the Egerfood Information System
• Crypto-integrity

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)