The following pages link to (Q4940695):
Displaying 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Unconditionally anonymous ring and mesh signatures (Q321307) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Two-server password-only authenticated key exchange (Q414937) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Several cryptographic applications of \(\Sigma\)-protocol (Q473026) (← links)
- Concurrent signature without random oracles (Q476860) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- New receipt-free voting scheme using double-trapdoor commitment (Q543836) (← links)
- Electronic jury voting protocols (Q596143) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- An efficient conditionally anonymous ring signature in the random oracle model (Q690468) (← links)
- Certificateless threshold ring signature (Q730948) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- A short non-delegatable strong designated verifier signature (Q893866) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- The ring authenticated encryption scheme-how to provide a clue wisely (Q1007859) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Confidential and efficient asset proof for bitcoin exchanges (Q1615407) (← links)
- All-but-many encryption (Q1747665) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Threshold ring signatures: new definitions and post-quantum security (Q2055701) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- More efficient digital signatures with tight multi-user security (Q2061945) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more (Q2104233) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Designated-verifier linkable ring signatures (Q2104415) (← links)
- Unlinkable and invisible \(\gamma \)-sanitizable signatures (Q2117037) (← links)
- Short identity-based signatures with tight security from lattices (Q2118556) (← links)
- DualRing: generic construction of ring signatures with efficient instantiations (Q2120078) (← links)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs (Q2149816) (← links)
