Filtrer vos résultats
- 38
- 3
- 40
- 1
- 41
- 9
- 7
- 10
- 6
- 5
- 2
- 2
- 41
- 21
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 41
- 9
- 7
- 6
- 5
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
41 résultats
|
|
|
triés par
|
|
|
Improved Private Set Intersection for Sets with Small Entries26th IACR International Conference on Practice and Theory of Public-Key Cryptography,, May 2023, Atlanta (GA), United States. pp.190-220, ⟨10.1007/978-3-031-31371-4_7⟩
Communication dans un congrès
hal-04265603v1
|
||
Removing the Strong RSA Assumption from Arguments over the IntegersEUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr 2017, Paris, France. ⟨10.1007/978-3-319-56614-6_11⟩
Communication dans un congrès
hal-01471901v1
|
|||
|
|
Oblivious Transfer with Constant Computational Overhead42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2023), Apr 2023, Lyon, France. pp.271-302, ⟨10.1007/978-3-031-30545-0_10⟩
Communication dans un congrès
hal-04265616v1
|
||
|
|
Non-Interactive Secure Computation of Inner-Product from LPN and LWEAdvances in Cryptology - ASIACRYPT 2022, Dec 2022, Taipei, Taiwan
Communication dans un congrès
hal-03860759v1
|
||
|
|
Partially-Fair Computation from Timed-Release Encryption and Oblivious TransferACISP 2021 - The 26th Australasian Conference on Information Security and Privacy, Dec 2021, Perth, Australia
Communication dans un congrès
hal-03375287v1
|
||
|
|
Sublinear-Communication Secure Multiparty Computation Does Not Require FHEEUROCRYPT 2023, Apr 2023, Lyon, France. pp.159-189, ⟨10.1007/978-3-031-30617-4_6⟩
Communication dans un congrès
hal-04265633v1
|
||
|
|
Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2023), Apr 2023, Lyon, France. pp.55-85, ⟨10.1007/978-3-031-30545-0_3⟩
Communication dans un congrès
hal-04265624v1
|
||
|
|
On Derandomizing Yao’s Weak-to-Strong OWF ConstructionTCC 2021 - Theory of Cryptography Conference, Nov 2021, Raleigh, United States
Communication dans un congrès
hal-03374577v1
|
||
|
|
Sharp: Short Relaxed Range ProofsCCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security, Nov 2022, Los Angeles CA USA, United States. pp.609-622, ⟨10.1145/3548606.3560628⟩
Communication dans un congrès
hal-03860720v1
|
||
|
|
Black-Box Uselessness: Composing Separations in CryptographyITCS 2021 - 12th Innovations in Theoretical Computer Science Conference, Feb 2021, Online, United States
Communication dans un congrès
hal-03374178v1
|
||
|
|
Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic LanguagesCRYPTO 2020 - Annual International Cryptology Conference, Aug 2020, Santa Barbara, United States. pp.768-798, ⟨10.1007/978-3-030-56877-1_27⟩
Communication dans un congrès
hal-03374157v1
|
||
|
|
On Building Fine-Grained One-Way Functions from Strong Average-Case HardnessEUROCRYPT 2022 - Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2021, Trondheim, Norway. pp.584-613, ⟨10.1007/978-3-031-07085-3_20⟩
Communication dans un congrès
hal-03860228v1
|
||
Homomorphic Secret Sharing: Optimizations and ApplicationsCCS '17 - ACM SIGSAC Conference on Computer and Communications Security , Oct 2017, Dallas, United States
Communication dans un congrès
hal-01614451v1
|
|||
|
|
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More *CRYPTO 2019 - Annual International Cryptology Conference, Aug 2019, Santa Barabara, United States. pp.489-518, ⟨10.1007/978-3-030-26954-8_16⟩
Communication dans un congrès
hal-03373123v1
|
||
Encryption Switching ProtocolsCrypto 2016 - 36th Annual International Cryptology Conference, Aug 2016, Santa Barbara, United States. ⟨10.1007/978-3-662-53018-4_12⟩
Communication dans un congrès
hal-01407341v1
|
|||
|
|
Sublinear Secure Computation from New AssumptionsTCC 2022 - Theory of Cryptography Conference, Nov 2022, Chicago, United States
Communication dans un congrès
hal-03860742v1
|
||
|
|
Pseudorandom Correlation Functions from Variable-Density LPN, RevisitedIACR 2023 - 26th International Conference on Practice and Theory of Public-Key Cryptography, May 2023, Atlanta, United States. pp.221-250, ⟨10.1007/978-3-031-31371-4_8⟩
Communication dans un congrès
hal-03947831v1
|
||
|
|
Secure Distributed Computation on Private InputsFoundations and Practice of Security, 9482, Springer International Publishing, pp.14-26, 2016, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-30303-1_2⟩
Chapitre d'ouvrage
hal-03373060v1
|
||
|
|
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iOPKC 2020 - IACR International Conference on Public-Key Cryptography, Apr 2020, Édimbourg, United Kingdom. pp.187-219, ⟨10.1007/978-3-030-45374-9_7⟩
Communication dans un congrès
hal-03374134v1
|
||
|
|
Black-Box Uselessness: Composing Separations in CryptographyITCS 2021, Jan 2021, Online, France
Communication dans un congrès
hal-03860811v1
|
||
|
|
Low-Complexity Weak Pseudorandom Functions in $$\mathtt {AC}0[\mathtt {MOD}2]$$CRYPTO 2021 - Annual International Cryptology Conference, Aug 2021, Santa Barbara, United States. pp.487-516, ⟨10.1007/978-3-030-84259-8_17⟩
Communication dans un congrès
hal-03374521v1
|
||
|
|
On Pseudorandom EncodingsTCC 2020 - Theory of Cryptography Conference, Dec 2020, Durham, United States. pp.639-669, ⟨10.1007/978-3-030-64381-2_23⟩
Communication dans un congrès
hal-03374163v1
|
||
|
|
Breaking the Circuit Size Barrier for Secure Computation Under Quasi-Polynomial LPNEUROCRYPT 2021 - Annual International Conference on the Theory and Applications of Cryptographic Techniques, Oct 2021, Zagreb, Croatia. pp.842-870, ⟨10.1007/978-3-030-77886-6_29⟩
Communication dans un congrès
hal-03374180v1
|
||
|
|
Designated-Verifier Pseudorandom Generators, and Their ApplicationsEUROCRYPT 2019 - Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr 2019, Darmstadt, Germany. pp.562-592, ⟨10.1007/978-3-030-17656-3_20⟩
Communication dans un congrès
hal-03373101v1
|
||
|
|
A Note on Non-Interactive Zero-Knowledge from CDH43rd Annual International Cryptology Conference, CRYPTO 2023,, Aug 2023, Santa Barbara (CA), France. pp.731-764, ⟨10.1007/978-3-031-38551-3_23⟩
Communication dans un congrès
hal-04265640v1
|
||
|
|
Constrained Pseudorandom Functions from Homomorphic Secret Sharing42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques,EUROCRYPT 2023, Apr 2023, Lyon, France. pp.194-224, ⟨10.1007/978-3-031-30620-4_7⟩
Communication dans un congrès
hal-04265643v1
|
||
|
|
Random Sources in Private ComputationAdvances in Cryptology - ASIACRYPT 2022, Dec 2022, Taipei, Taiwan
Communication dans un congrès
hal-03869622v1
|
||
|
|
Anonymous Whistleblowing over Authenticated ChannelsTCC 2022 - Theory of Cryptography Conference, Nov 2022, Chicago, United States
Communication dans un congrès
hal-03860748v1
|
||
|
|
Efficient Range Proofs with Transparent Setup from Bounded Integer CommitmentsEUROCRYPT 2021 - Annual International Conference on the Theory and Applications of Cryptographic Techniques, Oct 2021, Zagreb, Croatia. pp.247-277, ⟨10.1007/978-3-030-77883-5_9⟩
Communication dans un congrès
hal-03374179v1
|
||
|
|
Efficient NIZKs for Algebraic SetsASIACRYPT 2021 - International Conference on the Theory and Application of Cryptology and Information Security, Dec 2021, Online, Singapore
Communication dans un congrès
hal-03374536v1
|
- 1
- 2