Filtrer vos résultats
- 15
- 7
- 16
- 6
- 22
- 1
- 1
- 1
- 2
- 4
- 2
- 4
- 6
- 1
- 22
- 16
- 12
- 10
- 7
- 6
- 5
- 4
- 4
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 8
- 5
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
22 résultats
|
|
|
triés par
|
|
|
Prover efficient public verification of dense or sparse/structured matrix-vector multiplicationACISP 2017 - 22nd Australasian Conference on Information Security and Privacy, Jul 2017, Auckland, New Zealand. pp.115-134, ⟨10.1007/978-3-319-59870-3_7⟩
Communication dans un congrès
hal-01503870v1
|
||
|
|
Loop abort Faults on Lattice-Based Fiat-Shamir & Hash'n Sign signatures23rd Conference on Selected Area In Cryptography, Aug 2016, Saint John's, Canada
Communication dans un congrès
hal-01561424v1
|
||
On a Dual/Hybrid Approach to Small Secret LWEINDOCRYPT 2020 - 21st International Conference on Cryptology in India, Dec 2020, Bangalore, India. pp.440-462, ⟨10.1007/978-3-030-65277-7_20⟩
Communication dans un congrès
hal-03219138v1
|
|||
|
|
Certified lattice reductionAdvances in Mathematics of Communications, 2020, 14 (1), pp.137-159. ⟨10.3934/amc.2020011⟩
Article dans une revue
hal-02383752v1
|
||
|
|
Proving uniformity and independence by self-composition and couplingLPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, May 2017, Maun, Botswana. pp.19
Communication dans un congrès
hal-01541198v1
|
||
|
|
Proving expected sensitivity of probabilistic programsProceedings of the ACM on Programming Languages, 2017, 2 (POPL), pp.1-29. ⟨10.1145/3158145⟩
Article dans une revue
hal-01959322v1
|
||
Succinct Diophantine-Satisfiability ArgumentsAsiacrypt 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Daejeon / Virtual, South Korea. pp.774-804, ⟨10.1007/978-3-030-64840-4_26⟩
Communication dans un congrès
hal-02929841v1
|
|||
|
|
Side-Channel Attacks on BLISS Lattice-Based Signatures2017 ACM Conference on Computer and Communications Security (CCS 2017), Oct 2017, Dallas, TX, United States. pp.1857-1874, ⟨10.1145/3133956.3134028⟩
Communication dans un congrès
hal-01648080v1
|
||
|
|
Lower and Upper Bounds on the Randomness Complexity of Private Computations of ANDTCC 2019 - 17th International Conference on Theory of Cryptography, Dec 2019, Nuremberg, Germany. pp.386-406, ⟨10.1007/978-3-030-36033-7_15⟩
Communication dans un congrès
hal-02395052v1
|
||
|
|
Analysis and Improvement of an Authentication Scheme in Incremental CryptographySAC 2018 - 25th International Conference on Selected Areas in Cryptography, Aug 2018, Calgary, Canada. pp.50-70, ⟨10.1007/978-3-030-10970-7_3⟩
Communication dans un congrès
hal-01893905v1
|
||
|
|
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $Advances in Mathematics of Communications, 2024, 18 (3), pp.674-695. ⟨10.3934/amc.2022018⟩
Article dans une revue
hal-03611829v1
|
||
|
|
We are on the same side. Alternative sieving strategies for the number field sieveASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2023, Guangzhou, China. pp.138-166, ⟨10.1007/978-981-99-8730-6_5⟩
Communication dans un congrès
hal-04112671v1
|
||
|
|
Masking the GLP Lattice-Based Signature Scheme at Any OrderEurocrypt 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr 2018, Tel Aviv, Israel. pp.354-384, ⟨10.1007/978-3-319-78375-8_12⟩
Communication dans un congrès
hal-01900708v1
|
||
|
|
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISSASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2018, Brisbane, QLD, Australia. pp.494-524, ⟨10.1007/978-3-030-03326-2_17⟩
Communication dans un congrès
hal-02073933v1
|
||
|
|
Hardware security without secure hardware: How to decrypt with a password and a serverTheoretical Computer Science, 2021, 895, pp.178-211. ⟨10.1016/j.tcs.2021.09.042⟩
Article dans une revue
hal-03378464v1
|
||
Public-Key Generation with Verifiable RandomnessAsiacrypt 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Daejeon / Virtual, South Korea. pp.97-127, ⟨10.1007/978-3-030-64837-4_4⟩
Communication dans un congrès
hal-02929843v1
|
|||
|
|
Lattice Attacks on Pairing-Based SignaturesIMACC 2017 - 16th IMA International Conference on Cryptography and Coding, Dec 2017, Oxford, United Kingdom. pp.352-370, ⟨10.1007/978-3-319-71045-7_18⟩
Communication dans un congrès
hal-01737064v1
|
||
|
|
An Assertion-Based Program Logic for Probabilistic ProgramsLecture Notes in Computer Science, Apr 2018, Thessaloniki, Greece. pp.117-144, ⟨10.1007/978-3-319-89884-1_5⟩
Communication dans un congrès
hal-01959567v1
|
||
Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with RejectionASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2022, Taipei, Taiwan. pp.371-402, ⟨10.1007/978-3-031-22966-4_13⟩
Communication dans un congrès
hal-03941457v1
|
|||
Loop-Abort Faults on Lattice-Based Signatures and Key Exchange ProtocolsIEEE Transactions on Computers, 2018, 67 (11), pp.1535-1549. ⟨10.1109/TC.2018.2833119⟩
Article dans une revue
hal-02073941v1
|
|||
|
|
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal ConstructionsAlgorithmica, 2021, 83 (1), pp.72-115. ⟨10.1007/s00453-020-00750-2⟩
Article dans une revue
hal-02899803v1
|
||
|
|
Computing generator in cyclotomic integer rings36th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2017), Apr 2017, Paris, France. pp.60-88, ⟨10.1007/978-3-319-56620-7_3⟩
Communication dans un congrès
hal-01518438v1
|