Pages that link to "Item:Q5428128"

The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428128):

Displaying 37 items.

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Short undeniable signatures based on group homomorphisms (Q451120) (← links)
• Timed encryption with application to deniable key exchange (Q477191) (← links)
• Non-adaptive programmability of random oracle (Q500974) (← links)
• Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
• Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
• A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
• New approaches for deniable authentication (Q1037236) (← links)
• Generic transformation from broadcast encryption to round-optimal deniable ring authentication (Q2115719) (← links)
• An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable (Q2135524) (← links)
• Round-optimal black-box protocol compilers (Q2170000) (← links)
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
• Online-extractability in the quantum random-oracle model (Q2170106) (← links)
• Succinct arguments in the quantum random oracle model (Q2175929) (← links)
• A new framework for deniable secure key exchange (Q2672249) (← links)
• Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
• The round complexity of quantum zero-knowledge (Q2695629) (← links)
• A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
• Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
• A second note on the feasibility of generalized universal composability (Q3130297) (← links)
• Interactive Oracle Proofs (Q3181021) (← links)
• Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
• Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
• One-Time Programs (Q3600212) (← links)
• How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
• How to Build a Hash Function from Any Collision-Resistant Function (Q5387097) (← links)
• Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
• Efficient verifiable delay functions (Q5919019) (← links)
• On the correlation complexity of MPC with cheater identification (Q6573954) (← links)
• Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
• Approximate lower bound arguments (Q6637520) (← links)
• Witness semantic security (Q6637541) (← links)
• Sometimes you can't distribute random-oracle-based proofs (Q6652973) (← links)
• Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)