Foundations of Cryptography
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- A black-box construction of non-malleable encryption from semantically secure encryption
- Anonymous Quantum Communication
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
- Semi-quantum money
- PCPs and the hardness of generating synthetic data
- Introduction to security reduction
- Actively secure half-gates with minimum overhead under duplex networks
- Trustworthy sealed-bid auction with low communication cost atop blockchain
- Amortizing division and exponentiation
- Public-algorithm substitution attacks: subverting hashing and verification
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Hiding the input-size in multi-party private set intersection
- Distributing keys and random secrets with constant complexity
- On security notions for encryption in a quantum world
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Enhancements of trapdoor permutations
- Foundations of Cryptography
- Cryptographic one-way function based on boson sampling
- On the universal steganography of optimal rate
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- How to Fill Up Merkle-Damgård Hash Functions
- On the (im-)possibility of extending coin toss
- On constructing 1-1 one-way functions
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- On the (Im-)Possibility of Extending Coin Toss
- The concrete security of two-party computation: simple definitions, and tight proofs for PSI and OPRFs
- Weak zero-knowledge via the Goldreich-Levin theorem
- Adaptor signatures: new security definition and a generic construction for NP relations
- Providing data confidentiality against malicious hosts in shared data spaces
- On the power of an honest majority in three-party computation without broadcast
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- 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
- OptORAMa: Optimal oblivious RAM
- Public-key quantum digital signature scheme with one-time pad private-key
- Concurrent knowledge extraction in public-key models
- Efficient set intersection with simulation-based security
- The Layered Games Framework for Specifications and Analysis of Security Protocols
- Interactive knowledge discovery from hidden data through sampling of frequent patterns
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Multi-input non-interactive functional encryption: constructions and applications
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Efficient computations over encrypted data blocks
- Secure two-party computation: a visual way
- On \(d\)-multiplicative secret sharing
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- A note on constant-round zero-knowledge proofs of knowledge
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
- Perennial secure multi-party computation of universal Turing machine
- Communication optimal Tardos-based asymmetric fingerprinting
- Oblivious sampling with applications to two-party k-means clustering
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols
- Private set intersection: new generic constructions and feasibility results
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
- Program equivalence in linear contexts
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Analyzing security protocols using time-bounded task-PIOAs
- Constant-round maliciously secure two-party computation in the RAM model
- Fiat-Shamir transformation of multi-round interactive proofs
- Three party secure computation with friends and foes
- Some (in)sufficient conditions for secure hybrid encryption
- From non-adaptive to adaptive pseudorandom functions
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- 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
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- Randomness and computation
- Automata evaluation and text search protocols with simulation-based security
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Round-optimal secure multi-party computation
- Sublinear GMW-style compiler for MPC with preprocessing
- SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Composable long-term security with rewinding
- Pseudorandomness with proof of destruction and applications
- More on average case vs approximation complexity
- Characterization of secure multiparty computation without broadcast
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- A proof of security of Yao's protocol for two-party computation
- Perfect secure computation in two rounds
- Lower bounds on the efficiency of encryption and digital signature schemes
- MPC vs. SFE : Unconditional and Computational Security
- Characterization of secure multiparty computation without broadcast
- Oblivious signature-based envelope
- Oblivious Transfer Based on the McEliece Assumptions
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
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)
