647 results on '"Gilles Barthe"'
Search Results
52. Certified Compilation for Cryptography: Extended x86 Instructions and Constant-Time Verification.
53. Constant-time foundations for the new spectre era.
54. On the Versatility of Open Logical Relations - Continuity, Automatic Differentiation, and a Containment Theorem.
55. Higher-order probabilistic adversarial computations: categorical semantics and program logics.
56. A pre-expectation calculus for probabilistic sensitivity.
57. Deciding accuracy of differential privacy schemes.
58. On continuation-passing transformations and expected cost analysis.
59. Flux: Liquid Types for Rust.
60. CoqQ: Foundational Verification of Quantum Programs.
61. On Feller Continuity and Full Abstraction (Long Version).
62. Formally verifying Kyber Part I: Implementation Correctness.
63. Privacy Amplification by Mixing and Diffusion Mechanisms.
64. Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy.
65. FaCT: a DSL for timing-sensitive computation.
66. Bidirectional type checking for relational properties.
67. GALACTICS: Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited.
68. A Machine-Checked Proof of Security for AWS Key Management Service.
69. Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3.
70. Verifying Relational Properties using Trace Logic.
71. Symbolic Methods in Computational Cryptography Proofs.
72. maskVerif: Automated Verification of Higher-Order Masking in Presence of Physical Defaults.
73. Formal verification of a constant-time preserving C compiler.
74. A probabilistic separation logic.
75. Relational proofs for quantum programs.
76. System-Level Non-interference of Constant-Time Cryptography. Part II: Verified Static Analysis and Stealth Memory.
77. Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations.
78. Almost Sure Productivity.
79. Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences.
80. Symbolic Proofs for Lattice-Based Cryptography.
81. Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus.
82. An Assertion-Based Program Logic for Probabilistic Programs.
83. Masking the GLP Lattice-Based Signature Scheme at Any Order.
84. Enforcing Ideal-World Leakage Bounds in Real-World Secret Sharing MPC Frameworks.
85. Secure Compilation of Side-Channel Countermeasures: The Case of Cryptographic 'Constant-Time'.
86. A Quantum Interpretation of Bunched Logic for Quantum Separation Logic.
87. SoK: Practical Foundations for Spectre Defenses.
88. Automated Analysis of Cryptographic Assumptions in Generic Group Models.
89. Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization.
90. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
91. System-Level Non-interference of Constant-Time Cryptography. Part I: Model.
92. Spectre Declassified: Reading from the Right Place at the Wrong Time.
93. Typing High-Speed Cryptography against Spectre v1.
94. Breaking and Fixing Speculative Load Hardening.
95. A formal treatment of the role of verified compilers in secure computation.
96. *-Liftings for Differential Privacy.
97. Reasoning about Probabilistic Defense Mechanisms against Remote Attacks.
98. Proving uniformity and independence by self-composition and coupling.
99. Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions.
100. Jasmin: High-Assurance and High-Speed Cryptography.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.