The following pages link to (Q4318711):
Displayed 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Concurrent signature without random oracles (Q476860) (← links)
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- A one-round, two-prover, zero-knowledge protocol for NP (Q1894702) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Classical proofs of quantum knowledge (Q2056758) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- Practical algorithm substitution attack on extractable signatures (Q2119943) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Cryptographic reverse firewalls for interactive proof systems (Q2220883) (← links)
- Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts (Q2290624) (← links)
- A generic framework for accountable optimistic fair exchange protocol (Q2311072) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- Blind key-generation attribute-based encryption for general predicates (Q2673977) (← links)
- Generalized proofs of knowledge with fully dynamic setup (Q2695646) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Accountable Large-Universe Attribute-Based Encryption Supporting Any Monotone Access Structures (Q2817489) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts (Q2864362) (← links)
- A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function (Q2942846) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter (Q2980879) (← links)
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness (Q2988351) (← links)
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications (Q3011901) (← links)
- Identification Schemes from Key Encapsulation Mechanisms (Q3011903) (← links)
- Proving Computational Ability (Q3088170) (← links)
- Strong Proofs of Knowledge (Q3088175) (← links)
- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge (Q3088182) (← links)
- Precise Time and Space Simulatable Zero-Knowledge (Q3092346) (← links)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy (Q3092348) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers (Q3452351) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)