Cryptography and cryptographic protocols

DOI10.1007/S00446-002-0077-1MaRDI QIDQ5138490zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cryptography

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(19)

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

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)