Foundations of Cryptography
From MaRDI portal
Publication:4826097
DOI10.1017/CBO9780511721656zbMATH Open1068.94011WikidataQ57831066 ScholiaQ57831066MaRDI QIDQ4826097FDOQ4826097
Authors: Oded Goldreich
Publication date: 9 November 2004
Recommendations
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)
- Semi-quantum money
- Introduction to security reduction
- Cryptographic one-way function based on boson sampling
- On the (im-)possibility of extending coin toss
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Multi-input non-interactive functional encryption: constructions and applications
- 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
- Private set intersection: new generic constructions and feasibility results
- Constant-round maliciously secure two-party computation in the RAM model
- Lower bounds on the efficiency of encryption and digital signature schemes
- MPC vs. SFE : Unconditional and Computational Security
- 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?
- Oblivious Transfer Based on the McEliece Assumptions
- Characterization of secure multiparty computation without broadcast
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Characterization of secure multiparty computation without broadcast
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Secure multiparty computation with sublinear preprocessing
- On the feasibility of extending oblivious transfer
- Secure quantum computation with classical communication
- Secure protocol transformations
- A note on perfect correctness by derandomization
- Improved signature schemes for secure multi-party computation with certified inputs
- Pseudo-free families of computational universal algebras
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Private set-intersection with common set-up
- Graph coloring applied to secure computation in non-abelian groups
- Semantic security and indistinguishability in the quantum world
- 3-message zero knowledge against human ignorance
- Privacy assurances in multiple data-aggregation transactions
- The complexity of differential privacy
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- 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
- Polynomial runtime and composability
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Efficient and secure outsourced approximate pattern matching protocol
- Group Encryption
- A note on perfect correctness by derandomization
- Cryptographic pseudorandom generators can make cryptosystems problematic
- Privacy preserving linear regression modeling of distributed databases
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- More efficient oblivious transfer extensions
- Privacy-preserving multikey computing framework for encrypted data in the cloud
- Dynamic full quantum one-way function based on quantum circuit mapping
- Privacy-preserving mixed set operations
- Oblivious transfer based on single-qubit rotations
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Title not available (Why is that?)
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Two-message, oblivious evaluation of cryptographic functionalities
- Constant-round asynchronous multi-party computation based on one-way functions
- Secure computation with low communication from cross-checking
- High-throughput secure three-party computation with an honest majority
- MPC with friends and foes
- Privacy preserving distributed optimization using homomorphic encryption
- A black-box construction of non-malleable encryption from semantically secure encryption
- 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
- On server trust in private proxy auctions
- An optimally fair coin toss
- On probabilistic versus deterministic provers in the definition of proofs of knowledge
- Partial fairness in secure two-party computation
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)