The following pages link to Foundations of Cryptography (Q4328696):
Displayed 48 items.
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633) (← links)
- Improved hardness amplification in NP (Q868960) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Modular approach to the design and analysis of password-based security protocols (Q2385411) (← links)
- Universally composable anonymous hash certification model (Q2385415) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- A framework for real-valued cipher systems (Q2425831) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- In search of mathematical primitives for deriving universal projective hash families (Q2426956) (← links)
- Two methods for privacy preserving data mining with malicious participants (Q2456504) (← links)
- Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) (← links)
- Fast S-box security mechanism research based on the polymorphic cipher (Q2476793) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs (Q2481774) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- Contract signing, optimism, and advantage (Q2484408) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Universal test for quantum one-way permutations (Q2575756) (← links)
- An Infinitely-Often One-Way Function Based on an Average-Case Assumption (Q3511459) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- QUAD: A Practical Stream Cipher with Provable Security (Q3593092) (← links)
- Unlinkable Randomizable Signature and Its Application in Group Signature (Q3600344) (← links)
- Limits of Constructive Security Proofs (Q3600381) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- A note on the feasibility of generalised universal composability (Q3616225) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Brute force attacks on hash functions (Q5421207) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- The Twin Diffie-Hellman Problem and Applications (Q5458589) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security (Q5492131) (← links)
- Interactive Hashing: An Information Theoretic Tool (Invited Talk) (Q5502788) (← links)
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library (Q5505478) (← links)