The following pages link to Compact E-Cash (Q5385736):
Displaying 35 items.
- Policy-based signature scheme from lattices (Q306050) (← links)
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts (Q548093) (← links)
- Conditional e-payments with transferability (Q635291) (← links)
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system (Q1639394) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
- Transferable e-cash: a cleaner model and the first practical instantiation (Q2061973) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- UC priced oblivious transfer with purchase statistics and dynamic pricing (Q2179394) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- WOTS-S: a quantum secure compact signature scheme for distributed ledger (Q2666865) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- Scalable Divisible E-cash (Q2794505) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources (Q2889864) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Sub-linear Size Traceable Ring Signatures without Random Oracles (Q3073719) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Universally Composable Adaptive Priced Oblivious Transfer (Q3392915) (← links)
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (Q3506405) (← links)
- Privacy Preserving Data Mining within Anonymous Credential Systems (Q3540036) (← links)
- Tracing Malicious Proxies in Proxy Re-encryption (Q3600514) (← links)
- Decentralized Anonymous Micropayments (Q5267420) (← links)
- Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function (Q5267798) (← links)
- Efficient Non-interactive Range Proof (Q5323058) (← links)
- Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups (Q5502760) (← links)
- Type-Based Proxy Re-encryption and Its Construction (Q5504618) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
