Filters








47 Hits in 3.3 sec

Deep Face Fuzzy Vault: Implementation and Performance [article]

Christian Rathgeb, Johannes Merkle, Johanna Scholz, Benjamin Tams, Vanessa Nesterowicz
2021 arXiv   pre-print
In this context, biometric cryptosystems are designed to meet key requirements of biometric information protection enabling a privacy-preserving storage and comparison of biometric data.  ...  As part of said feature transformation, a detailed analysis of different feature quantisation and binarisation techniques is conducted.  ...  In contrast to cancelable biometrics and homomorphic encryption, biometric cryptosystems enable the binding and retrieval of digital keys.  ... 
arXiv:2102.02458v2 fatcat:ryw7fm5lmfe7veg7lqfna2s3me

Abstract Tensor Systems as Monoidal Categories [article]

Aleks Kissinger
2013 arXiv   pre-print
A notable consequence of this result is a simple proof for the soundness and completeness of the diagrammatic language for traced symmetric monoidal categories.  ...  To do so, we introduce a typed, sum-free version of an abstract tensor system and demonstrate the construction of its associated category.  ...  We can prove this by demonstrating a (traced symmetric monoidal) isomorphism of categories between Anchor(Sig(A)) and C[Free(A)].  ... 
arXiv:1308.3586v1 fatcat:cehr2n3dordifppyzazidpwg7q

Distributed Random Process for a Large-Scale Peer-to-Peer Lottery [chapter]

Stéphane Grumbach, Robert Riemann
2017 Lecture Notes in Computer Science  
Most online lotteries today fail to ensure the verifiability of the random process and rely on a trusted third party.  ...  As a result, the protocol is scalable, provides efficient verification of the random process and does not rely on a trusted third party nor on assumptions of bounded computational resources.  ...  Acknowledgments The authors would like to thank Pascal Lafourcade and Matthieu Giraud for fruitful discussions concerning the security of the lottery protocol and the underlying distributed aggregation  ... 
doi:10.1007/978-3-319-59665-5_3 fatcat:y6cwj47cqngnvipq5tkz25v7sy

Graphical Calculi and their Conjecture Synthesis [article]

Hector Miller-Bakewell
2020 arXiv   pre-print
To this process we introduce a generalisation step, which itself requires the ability to infer and then verify parameterised families of theorems.  ...  First is the calculus RING, which is initial among ring-based qubit graphical calculi, and in turn inspired the introduction and classification of phase homomorphism pairs also presented here.  ...  Acknowledgements This thesis was supervised by Bob Coecke, and the author would like to thank Aleks Kissinger and Miriam Backens for their academic support.  ... 
arXiv:2010.03914v1 fatcat:z4k2so32hvfjfjismyzwjjqmey

The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable

Tomasz Gogacz, Jerzy Marcinkowski
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecidable.  ...  For two structures D 1 and D over the same signature Σ a function h : Dom(D 1 ) → Dom(D) is called a homomorphism if for each P ∈ Σ of arity l and each tuplē a ∈ Dom(D) l if D 1 |= P (ā) then D |= P (h  ...  Then zoo(Q) is the smallest subset of A s containing ✩ and closed under functions from Q.  ... 
doi:10.1109/lics.2015.35 dblp:conf/lics/GogaczM15 fatcat:7kh635ymcbemzi3iwvklzewclq

Quantum cryptography beyond quantum key distribution

Anne Broadbent, Christian Schaffner
2015 Designs, Codes and Cryptography  
While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two- and multi-party computation  ...  Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition  ...  Acknowledgments It is a pleasure to acknowledge conversations with Gilles Brassard, Gus Gutoski, Serge Fehr and Louis Salvail in the preparation of this document.  ... 
doi:10.1007/s10623-015-0157-4 pmid:32226229 pmcid:PMC7089691 fatcat:zm7zdq4l6babtd4y5ygwmttt2q

Real ADE-equivariant (co)homotopy and Super M-branes [article]

John Huerta, Hisham Sati, Urs Schreiber
2019 arXiv   pre-print
A key open problem in M-theory is the identification of the degrees of freedom that are expected to be hidden at ADE-singularities in spacetime.  ...  We classify these super-cocycles and find a detailed black brane scan that enhances the entries of the old brane scan to cascades of fundamental brane super-cocycles on strata of intersecting black M-brane  ...  We thank Vincent Braunack-Mayer, David Corfield, Mike Duff, David Roberts, and Christian Saemann for useful comments. We thank the anonymous referee for careful reading and useful suggestions.  ... 
arXiv:1805.05987v3 fatcat:2qv6olwpozf7vmxrzmb3c4wdke

Advanced optical signatures of single, wurtzite GaN quantum dots [article]

Gordon Callsen, Technische Universität Berlin, Technische Universität Berlin, Axel Hoffmann, Matthew Phillips
2015
Based on the conjunction of excitation power dependent and time-resolved micro-Photoluminescence, an entire zoo of multiexcitonic complexes is identified for the first time.  ...  However, in terms of intra-quantum dot carrier relaxation, it is exactly these multi-phonon processes that present the limiting factor, a phenomenon known as the "phonon-bottleneck" effect.  ...  spin flip process as a key element.  ... 
doi:10.14279/depositonce-4470 fatcat:qdnbqdxonvbjhkbv3u2ssfynuq

Montgomery reduction within the context of residue number system arithmetic

Jean-Claude Bajard, Julien Eynard, Nabil Merkiche
2017 Journal of Cryptographic Engineering  
p and r.  ...  Within such schemes, modular reduction of large values is a core operation. Its efficiency is a critical issue for the effectiveness of practical implementations. In 1985, Peter L.  ...  Thus, some costly conversions between binary positional system and RNS have to be performed at the beginning and the end of a full procedure encryption+decryption or signature+verification.  ... 
doi:10.1007/s13389-017-0154-9 fatcat:fivjka3e7fdndcmagrezn2qgqi

The moduli space of matroids [article]

Matthew Baker, Oliver Lorscheid
2021 arXiv   pre-print
This yields a new proof of the fact that a matroid is regular if and only if it is both binary and orientable.  ...  We show that a matroid M is regular if and only if its foundation is the regular partial field, and a non-regular matroid M is binary if and only if its foundation is the field with two elements.  ...  The first author was supported by NSF Grant DMS-1529573 and a Simons Foundation Fellowship.  ... 
arXiv:1809.03542v2 fatcat:hunlgvtnhbcrfme4avknjacdoe

Subject index volumes 1–200

1999 Theoretical Computer Science  
a finite signature, 3385 infinite signatures, 3385 terms process -, 2263 rigid -, 2379 Gequivalent -, 2413 typed combinatory logic -, 2200 versus deductios, 13 12 with bound variables, 3679  ...  over infinite signatures, 3385 ordering, 728.2230 orders, 3385 partial order, 802 part of a relation, 1798 well-founded ranking, 645 to prove fair termination, 645 well-founded recursion, 2595  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Classical linear logic, cobordisms and categorial grammars [article]

Sergey Slavnov
2020 arXiv   pre-print
A key observation is that word cobordisms can be organized in a category, very similar to the familiar category of topological cobordisms.  ...  This category is symmetric monoidal closed and compact closed and thus is a model of linear λ-calculus and classical, as well as intuitionistic linear logic.  ...  satisfying the homomorphism propertyF (A ⊸ B) = F (A) ⊸ F (B), any signature axiom ⊢ c : T(c) of Σ abstr we assign the cowordism [c] = [φ(c)] : 1 → [φ(T(c))] = [T(c)].  ... 
arXiv:1911.03962v3 fatcat:6q4ywfjvqne5lcuvvd2wpmrgjy

Evolutionary and developmental dynamics of sex-biased gene expression in common frogs with proto-Y chromosomes

Wen-Juan Ma, Paris Veltsos, Roberto Sermier, Darren J Parker, Nicolas Perrin
2018 Genome Biology  
Conclusions: The proto-sex chromosome of common frogs does not show evidence of sexualization of gene expression, nor evidence for a faster rate of evolution.  ...  As a result, X chromosomes are often enriched in female-biased genes (feminization) and Z chromosomes in male-biased genes (masculinization).  ...  Toups made critical comments on an early version of the manuscript. Jason Buser and Julien Leuenberger helped in the rearing of froglets.  ... 
doi:10.1186/s13059-018-1548-4 fatcat:pryck3c3ardmdoipt7zsvunwha

Background Subtraction in Real Applications: Challenges, Current Models and Future Directions [article]

T. Bouwmans, B. Garcia-Garcia
2019 arXiv   pre-print
Most of them concern the application of mathematical and machine learning models to be more robust to the challenges met in videos.  ...  In addition, the videos evaluated in large-scale datasets are not exhaustive in the way that they only covered a part of the complete spectrum of the challenges met in real applications.  ...  Thus, value of certain pixel would have sudden change when target signature is moving onto and -7leaving it.  ... 
arXiv:1901.03577v1 fatcat:sstv5kua45aixaslrajklv2rae

Erratum: How to do things with historical texts

Richard Biernacki
2015 American Journal of Cultural Sociology  
He has also published comparative historical studies of the commercialization of human activity, including The Fabrication of Labor: Germany and Britain, 1640-1914 (Berkeley: University of California  ...  About the Author Richard Biernacki is author of Reinventing Evidence in Social Inquiry (New York: Palgrave Macmillan, 2012).  ...  But lacking structure, the word counts offer no map-to-landscape homomorphism of a kind that lets us discern anomalies.  ... 
doi:10.1057/ajcs.2015.8 fatcat:gibbntd2xrervcfvpzlurwkici
« Previous Showing results 1 — 15 out of 47 results