Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kapron, Bruce M.
~ 100  Ergebnisse:
Personensuche X
?
1

Linicrypt in the Ideal Cipher Model:

, In: Provable and Practical Security; Lecture Notes in Computer Science,
Javar, Zahra ; Kapron, Bruce M. - p. 91-111 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Preimage Awareness in Linicrypt:

, In: 2023 IEEE 36th Computer Security Foundations Symposium (CSF),
Javar, Zahra ; Kapron, Bruce M. - p. 33-42 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Authentication of variable length messages in quantum key d..:

Bibak, Khodakhast ; Kapron, Bruce M. ; Srinivasan, Venkatesh
EPJ Quantum Technology.  9 (2022)  1 - p. , 2022
Link: https://doi.org/10.1140/..
 
?
4

Complete and tractable machine-independent characterization..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves. - p. 368-388 , 2022
Link: https://doi.org/10.1007/..
 
?
5

A tier-based typed programming language characterizing Feas..:

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves.
Logical Methods in Computer Science.  18, Issue 1 (2022)  - p. , 2022
Link: https://doi.org/10.46298..
 
?
6

Differentially Private Attributed Network Releasing Based o..:

Wang, Yuye ; Yang, Jing ; Zhan, Jianpei.
Security and Communication Networks.  2021 (2021)  - p. 1-13 , 2021
Link: https://doi.org/10.1155/..
 
?
7

Type-two polynomial-time and restricted lookahead:

Kapron, Bruce M. ; Steinberg, Florian
Theoretical Computer Science.  813 (2020)  - p. 1-19 , 2020
Link: https://doi.org/10.1016/..
 
?
8

A tier-based typed programming language characterizing Feas..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves. - p. 535-549 , 2020
Link: https://dl.acm.org/doi/1..
 
?
9

A generalization of Schönemann's theorem via a graph theore..:

Bibak, Khodakhast ; Kapron, Bruce M. ; Srinivasan, Venkatesh
Discrete Mathematics.  342 (2019)  11 - p. 3057-3061 , 2019
Link: https://doi.org/10.1016/..
 
?
10

Type-two polynomial-time and restricted lookahead:

, In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
Kapron, Bruce M. ; Steinberg, Florian - p. 579-588 , 2018
Link: https://dl.acm.org/doi/1..
 
?
11

Unweighted linear congruences with distinct coordinates and..:

Bibak, Khodakhast ; Kapron, Bruce M. ; Srinivasan, Venkatesh
Designs, Codes and Cryptography.  86 (2017)  9 - p. 1893-1904 , 2017
Link: https://doi.org/10.1007/..
 
?
12

Restricted linear congruences:

Bibak, Khodakhast ; Kapron, Bruce M. ; Srinivasan, Venkatesh..
Journal of Number Theory.  171 (2017)  - p. 128-144 , 2017
Link: https://doi.org/10.1016/..
 
?
13

Counting surface-kernel epimorphisms from a co-compact Fuch..:

Bibak, Khodakhast ; Kapron, Bruce M. ; Srinivasan, Venkatesh
Nuclear Physics B.  910 (2016)  - p. 712-723 , 2016
Link: https://doi.org/10.1016/..
 
?
14

Reproducible Circularly Secure Bit Encryption: Applications..:

Hajiabadi, Mohammad ; Kapron, Bruce M.
Journal of Cryptology.  30 (2016)  4 - p. 1187-1237 , 2016
Link: https://doi.org/10.1007/..
 
?
15

MMH⁎ with arbitrary modulus is always almost-universal:

Bibak, Khodakhast ; Kapron, Bruce M. ; Srinivasan, Venkatesh
Information Processing Letters.  116 (2016)  7 - p. 481-483 , 2016
Link: https://doi.org/10.1016/..
 
1-15