The following pages link to Jan Camenisch (Q587570):
Displaying 50 items.
- Remarks on ``Analysis of one popular group signature scheme'' in Asiacrypt 2006 (Q843367) (← links)
- Logarithm Cartesian authentication codes. (Q1398375) (← links)
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. (Q1573770) (← links)
- Security arguments for digital signatures and blind signatures (Q1573771) (← links)
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes (Q1598873) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Floppy-sized group signatures from lattices (Q1656030) (← links)
- Anonymous attestation with subverted TPMs (Q1675212) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Weil descent of Jacobians. (Q1811101) (← links)
- Batch verification of short signatures (Q1928768) (← links)
- The state of elliptic curve cryptography (Q1976039) (← links)
- Short threshold dynamic group signatures (Q2106657) (← links)
- Efficient fully secure leakage-deterring encryption (Q2177656) (← links)
- iUC: flexible universal composability made simple (Q2178853) (← links)
- Password-authenticated public-key encryption (Q2291402) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Practical strongly invisible and strongly accountable sanitizable signatures (Q2399980) (← links)
- Fine-grained forward-secure signature schemes without random oracles (Q2489913) (← links)
- (Q2707429) (← links)
- (Q2707436) (← links)
- (Q2754171) (← links)
- (Q2757245) (← links)
- (Q2778843) (← links)
- Recovering Lost Device-Bound Credentials (Q2794506) (← links)
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions (Q2795974) (← links)
- Universally Composable Direct Anonymous Attestation (Q2798801) (← links)
- Formal Treatment of Privacy-Enhancing Credential Systems (Q2807189) (← links)
- Memory Erasability Amplification (Q2827713) (← links)
- Virtual Smart Cards: How to Sign with a Password and a Server (Q2827728) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment (Q2874541) (← links)
- Computing on Authenticated Data (Q2891473) (← links)
- Fully Anonymous Attribute Tokens from Lattices (Q2912786) (← links)
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions (Q2912787) (← links)
- Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption (Q2912819) (← links)
- Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn (Q2925560) (← links)
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures (Q2938865) (← links)
- Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions (Q2941197) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
- Provably linkable trading (Q3005358) (← links)
- Oblivious Transfer with Hidden Access Control Policies (Q3084348) (← links)
- Structure Preserving CCA Secure Encryption and Applications (Q3102179) (← links)
- A Framework for Practical Universally Composable Zero-Knowledge Protocols (Q3102202) (← links)
- Randomizable Proofs and Delegatable Anonymous Credentials (Q3183560) (← links)
- (Q3374912) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Balancing Accountability and Privacy Using E-Cash (Extended Abstract) (Q3541884) (← links)
- Credential Authenticated Identification and Key Exchange (Q3582759) (← links)
- Get Shorty via Group Signatures without Encryption (Q3588355) (← links)
