Pages that link to "Item:Q3452352"

The following pages link to Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing (Q3452352):

Displaying 19 items.

• Concurrent knowledge extraction in public-key models (Q271592) (← links)
• On the security of joint signature and encryption revisited (Q350517) (← links)
• Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
• Verifiability-based conversion from CPA to CCA-secure predicate encryption (Q683914) (← links)
• Robust random number generation for peer-to-peer systems (Q1004308) (← links)
• Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
• Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
• Black-box non-interactive non-malleable commitments (Q2056786) (← links)
• On the CCA compatibility of public-key infrastructure (Q2061956) (← links)
• On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
• Continuously non-malleable secret sharing for general access structures (Q2175937) (← links)
• On the power of secure two-party computation (Q2303458) (← links)
• An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
• Collapse-Binding Quantum Commitments Without Random Oracles (Q2953776) (← links)
• Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial (Q2980866) (← links)
• Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
• (Q4638056) (← links)
• Doubly adaptive zero-knowledge proofs (Q6132969) (← links)