Foundations of Cryptography

DOI10.1017/CBO9780511721656zbMATH Open1068.94011WikidataQ57831066 ScholiaQ57831066MaRDI QIDQ4826097FDOQ4826097

Authors: Oded Goldreich 

Publication date: 9 November 2004

Recommendations

• scientific article; zbMATH DE number 5081837
• A Classical Introduction to Cryptography
• Introduction to cryptography. Principles and applications
• Modern cryptography primer. Theoretical foundations and practical applications
• Introduction to Modern Cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Authentication, digital signatures and secret sharing (94A62)

Cited In (only showing first 100 items - show all)

• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• How to Fill Up Merkle-Damgård Hash Functions
• Efficient perfectly secure computation with optimal resilience
• Efficient perfectly secure computation with optimal resilience
• OAEP Is Secure under Key-Dependent Messages
• Computational Security of Quantum Encryption
• Providing data confidentiality against malicious hosts in shared data spaces
• Public-key quantum digital signature scheme with one-time pad private-key
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• Fiat-Shamir transformation of multi-round interactive proofs
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• Some (in)sufficient conditions for secure hybrid encryption
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Round-optimal secure multi-party computation
• Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
• Perfect secure computation in two rounds
• Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
• Perfect secure computation in two rounds
• Oblivious signature-based envelope
• Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
• Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
• Order-revealing encryption and the hardness of private learning
• Anonymous protocols: notions and equivalence
• Notes on Levin's theory of average-case complexity
• Topology-hiding computation beyond logarithmic diameter
• Foundations of homomorphic secret sharing
• Cryptography and cryptographic protocols
• Security of blind signatures revisited
• Protocols for multiparty coin toss with a dishonest majority
• Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
• Privacy-preserving queries on encrypted data
• TinyKeys: a new approach to efficient multi-party computation
• Private multiparty sampling and approximation of vector combinations
• More constructions of lossy and correlation-secure trapdoor functions
• SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits
• Legally-Enforceable Fairness in Secure Two-Party Computation
• Key-dependent message security: generic amplification and completeness
• Better security for deterministic public-key encryption: the auxiliary-input setting
• Computationally secure pattern matching in the presence of malicious adversaries
• Handling expected polynomial-time strategies in simulation-based security proofs
• Constant-round maliciously secure two-party computation in the RAM model
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Randomness and Representation of Span n Sequences
• On expected constant-round protocols for Byzantine agreement
• Adaptive hardness and composable security in the plain model from standard assumptions
• Reducing complexity assumptions for statistically-hiding commitment
• Round-optimal and communication-efficient multiparty computation
• Certifying trapdoor permutations, revisited
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Threshold changeable secret sharing schemes revisited
• Verifiable composition of signature and encryption. A comprehensive study of the design paradigms
• Completeness for symmetric two-party functionalities: revisited
• Efficient Fully-Simulatable Oblivious Transfer
• Fast large-scale honest-majority MPC for malicious adversaries
• Quantum one-way permutation over the finite field of two elements
• Two methods for privacy preserving data mining with malicious participants
• Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
• The Complexity of Public-Key Cryptography
• Fairness versus guaranteed output delivery in secure multiparty computation
• The hunting of the SNARK
• How to simulate it -- a tutorial on the simulation proof technique
• Efficient Disjointness Tests for Private Datasets
• Multi-party computation with conversion of secret sharing
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Comparing two sets without disclosing them
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Practical Chosen Ciphertext Secure Encryption from Factoring
• Foundations of Cryptography
• Enhancements of trapdoor permutations
• On constructing 1-1 one-way functions
• On the (Im-)Possibility of Extending Coin Toss
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Concurrent knowledge extraction in public-key models
• Efficient set intersection with simulation-based security
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• On \(d\)-multiplicative secret sharing
• A note on constant-round zero-knowledge proofs of knowledge
• Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
• Program equivalence in linear contexts
• Analyzing security protocols using time-bounded task-PIOAs
• Randomness and computation
• Automata evaluation and text search protocols with simulation-based security
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• A proof of security of Yao's protocol for two-party computation
• More on average case vs approximation complexity
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• Efficient set operations in the presence of malicious adversaries
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Communication-efficient distributed oblivious transfer
• Simpler session-key generation from short random passwords
• A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
• OT-Combiners via Secure Computation
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Impossibility results for universal composability in public-key models and with fixed inputs
• Long-term security and universal composability

This page was built for publication: Foundations of Cryptography

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