Foundations of Cryptography
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On expected constant-round protocols for Byzantine agreement
- Private multiparty sampling and approximation of vector combinations
- A proof of security of Yao's protocol for two-party computation
- Analyzing security protocols using time-bounded task-PIOAs
- Handling expected polynomial-time strategies in simulation-based security proofs
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Reducing complexity assumptions for statistically-hiding commitment
- General composition and universal composability in secure multiparty computation
- Cryptography with constant input locality
- Perfect secure computation in two rounds
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
- Certifying trapdoor permutations, revisited
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- On the bit security of cryptographic primitives
- Public-key quantum digital signature scheme with one-time pad private-key
- Quantum one-way permutation over the finite field of two elements
- The hunting of the SNARK
- Fairness versus guaranteed output delivery in secure multiparty computation
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Secure computation with low communication from cross-checking
- Privacy preserving distributed optimization using homomorphic encryption
- Perennial secure multi-party computation of universal Turing machine
- A black-box construction of non-malleable encryption from semantically secure encryption
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Characterization of secure multiparty computation without broadcast
- Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
- Private set-intersection with common set-up
- Efficient and secure outsourced approximate pattern matching protocol
- Secure two-party computation via cut-and-choose oblivious transfer
- Graph coloring applied to secure computation in non-abelian groups
- More constructions of lossy and correlation-secure trapdoor functions
- Privacy preserving linear regression modeling of distributed databases
- On the (im-)possibility of extending coin toss
- Constant-round maliciously secure two-party computation in the RAM model
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
- Pseudo-free families of computational universal algebras
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Compact designated verifier NIZKs from the CDH assumption without pairings
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Compact NIZKs from standard assumptions on bilinear maps
- Going beyond dual execution: MPC for functions with efficient verification
- Cryptographic pseudorandom generators can make cryptosystems problematic
- On the distribution of low Hamming weight products
- MPC with friends and foes
- Cryptographic one-way function based on boson sampling
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- A black-box approach to post-quantum zero-knowledge in constant rounds
- 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
- Constant-round leakage-resilient zero-knowledge from collision resistance
- A note on perfect correctness by derandomization
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Constant-round client-aided secure comparison protocol
- Improved signature schemes for secure multi-party computation with certified inputs
- Round-optimal and communication-efficient multiparty computation
- Highly efficient OT-based multiplication protocols
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Asymptotically quasi-optimal cryptography
- Secure multiparty computation with sublinear preprocessing
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- Oblivious sampling with applications to two-party k-means clustering
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- CPP: towards comprehensive privacy preserving for query processing in information networks
- Confidential gossip
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- PCPs and the hardness of generating synthetic data
- On the universal steganography of optimal rate
- Symmetric cryptographic protocols for extended millionaires' problem
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- From non-adaptive to adaptive pseudorandom functions
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Anonymous protocols: notions and equivalence
- Program equivalence in linear contexts
- Cryptography and algorithmic randomness
- Quantum private comparison with a malicious third party
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Enhancements of trapdoor permutations
- Polynomial runtime and composability
- Security of blind signatures revisited
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Secure multi-party computation in large networks
- Private set intersection: new generic constructions and feasibility results
- More efficient oblivious transfer extensions
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Completeness for symmetric two-party functionalities: revisited
- On the feasibility of extending oblivious transfer
- Efficient RSA key generation and threshold Paillier in the two-party setting
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- In search of mathematical primitives for deriving universal projective hash families
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
- 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
- Simpler session-key generation from short random passwords
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)
