The following pages link to Damien Vergnaud (Q269478):
Displaying 50 items.
- Comment on ``A strong provably secure IBE scheme without bilinear map'' by M. Zheng, Y. Xiang and H. Zhou (Q269479) (← links)
- Enumeration formula for \((2,n)\)-cubes in discrete planes (Q713312) (← links)
- The key-dependent message security of key-alternating Feistel ciphers (Q826271) (← links)
- Multi-designated verifiers signatures: anonymity without encryption (Q845986) (← links)
- Time-selective convertible undeniable signatures with short conversion receipts (Q985073) (← links)
- Linear independence measure for squares of periods and quasi-periods of elliptic curves (Q1019825) (← links)
- Private multiplication over finite fields (Q1675211) (← links)
- Practical key recovery for discrete-logarithm based authentication schemes from random nonce bits (Q1695875) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- Analysis and improvement of an authentication scheme in incremental cryptography (Q1726662) (← links)
- Lattice attacks on pairing-based signatures (Q1744869) (← links)
- Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions (Q1755993) (← links)
- Reusing nonces in Schnorr signatures (and keeping it secure...) (Q2167718) (← links)
- Secure storage -- confidentiality and authentication (Q2172857) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods (Q2182710) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- Polynomial interpolation of the Naor-Reingold pseudo-random function (Q2363385) (← links)
- Hardware security without secure hardware: how to decrypt with a password and a server (Q2664944) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Public-key generation with verifiable randomness (Q2692338) (← links)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership (Q2790035) (← links)
- Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks (Q2794524) (← links)
- Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness (Q2798793) (← links)
- Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions (Q2799003) (← links)
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols (Q2845688) (← links)
- Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes (Q2873657) (← links)
- Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions (Q2891478) (← links)
- Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods (Q2900247) (← links)
- Compact Round-Optimal Partially-Blind Signatures (Q2912788) (← links)
- Full Disk Encryption: Bridging Theory and Practice (Q2975807) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Signatures on Randomizable Ciphertexts (Q3084361) (← links)
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security (Q3102176) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- On the Soundness of Restricted Universal Designated Verifier Signatures and Dedicated Signatures (Q3507873) (← links)
- Trapdoor Permutation Polynomials of ℤ/nℤ and Public Key Cryptosystems (Q3507884) (← links)
- Fair Blind Signatures without Random Oracles (Q3558301) (← links)
- On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption (Q3575032) (← links)
- Batch Groth–Sahai (Q3575048) (← links)
- Mediated Traceable Anonymous Encryption (Q3584974) (← links)
- New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures (Q3591429) (← links)
- Tracing Malicious Proxies in Proxy Re-encryption (Q3600514) (← links)
- Gradually Convertible Undeniable Signatures (Q3612402) (← links)
- Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys (Q3617524) (← links)
- NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES (Q3620617) (← links)
- Adaptive-ID Secure Revocable Identity-Based Encryption (Q3623031) (← links)
- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model (Q3648487) (← links)
- Provably Secure Code-Based Threshold Ring Signatures (Q3654620) (← links)
