Welcome! This talk presents the Message Authentication Code DAVMAC. My name is Eklist and this is joint work with Tony Groho and Ritu Nandi from ISI Kolkata. Message Authentication Codes. Take a message N and a secret key shared by the legit made sender and receiver. The purpose of a MAC is to produce unfortable texts to guarantee authenticity of the transmitted messages. MACs can be stateful, randomized, non-spaced or state the statistic. Here we focus on the letter. For the usual MAC security notion, the adversary has the goal to forge the valid tag for a message that has not authenticated before. For this purpose, the adversary can ask authentication and verification queries. However, it is more convenient to target PUF security instead. An adversary who cannot distinguish valid outputs from random bits has also a hard job to forge. A variety of MACs is built from classical block ciphers. Many are variants of either the sequential CMAC-like design or the paralyzable design of PMAC. Many of those constructions limit their security to the well-known birthday bound, which suffices in many cases. However, sometimes this is not the case, for example in applications with small size of the primitive. To provide higher security, a single accumulator is not enough, at least not for state the statistic MACs. Instead, a second accumulator is then used for both sequential constructions like 3KF9 or in parallel constructions like in PMAC+. To be able to block ciphers are keyed family of permutations that take an additional public input called the tweak. They are useful not only for MACs. The additional public tweak can be used for instance as a domain separator or to process more message material per call. Various existing MACs already make good use of tweaked block ciphers. At Profsec 2015, Nitro proposed PMAC-TBC1K and TBC3K. The primitive here ensured ambient security by having different domains for every call. In 2017, Coyati et al. proposed in total 4 MACs to a MONG based on regular block ciphers, called hash-stweak here, HST, and also nonce-stweak, however, are focuses on state the statistic constructions. Both used a universal hash function to first compress the message and then use the second hash of the message or the nonce-stweak and obtain NVID security also. At Profsec 2017, Iwata et al. proposed CMAC, also highly secure and even more efficient construction. Moreover, there are some hashes in authenticated encryption schemes that build on regular block ciphers. But let's focus for the moment on CMAC. The innovation of CMAC relied in its internal regular block cipher-based hash function, called C-Hash. C-Hash processes the message input in both the state and the tweak in nearly fully paralyzed manner. Therefore, CMAC could be more efficient than previous constructions. The state is accumulated in two lanes and at the end is processed in a complex finalization that consists of two sums of two independent permutations each to obtain a final output. One problem for lighter applications of CMAC is that it needs to hold the tweak state, the message state, masks and the accumulators. This increases the overall number of variables and therefore the size of the state. Sequential MACs can be made lighter, which may be desirable for some applications. Our motivating question was therefore, if we can reduce CMAC to a more sequential construction that does neither sacrifice its high security nor its high rate that CMAC can offer. In our work, we revisited the structure of CMAC and proposed DAF MAC. We arrived at a sequential tweakable block cipher-based design that accumulates the state in two lanes. We could obtain a security of the minimum of n or n plus t half bits. The hash function DAF hash processes n plus t bit per call to the primitive, similar as CMAC-like designs. Every block is processed in a single call to a tweakable block cipher, where in each block, both lanes are used as the input. The t-bit part is added to a top lane as a tweak input. The remaining n bits are exored to the lower lanes input. The feed forward ensures that the primitive output always affects both lanes. The pad function extends or truncates the n-bit output to t-bit before the next t-bit value is added. At the end, our hash function needs to check some to ensure high security, which adds all t values of a message. Otherwise, the modification of a single tweak input could produce collisions at the birthday bound. Our construction is an instance of hash as tweak by Coyati et al. or its generalization hashed in TBC. The finalization uses the n plus t bit output of the hash function and generates a random bit stream. Therefore, it employs the same tweakable block cipher as the hash function under a distinct key. The construction is easily extendable to a variable output PRF by adding a counter to every block and to produce a longer bit stream. Moreover, we could easily derive a single key version by reserving, for example, one more tweak domain bit or by fixing one bit of the tweak input. In the following, we would like to give a brief overview of our proof idea. Our analysis consists of three parts and an easy initial step. First, we replace the primitives with ideal ones. We reduce the construction to the fixed output length PRF security of hashed in TBC. For this purpose, we need two properties of the hash function. First, an upper bound on a collision probability among all messages. And second, a low probability of truncated collisions in X. In the following, we briefly sketch the ideas of those three steps. Prior, we briefly want to recall our notions. By call, we mean the maximal probability of a collision among any two, among Q pairwise distinct messages of at most B bit blocks each and sigma blocks in total. By T and epsilon truncated almost universality, we mean the probability that two messages collide in the first T bits of their outputs to be at most epsilon. First, we replace trigger block ciphers with two independent random idea trigger block ciphers over the same spaces. Next, we review our construction as an instance of hashed in TBC. So, we can apply its security statement. For a single output block, hashed in TBC needs two security properties from the hash function as set. One is a maximal collision probability of epsilon one for any pair of this joint messages. The other one is that the probability that any two among the messages collide in X, which has to be at most epsilon two. Then, we have a relatively simple statement left. What remains is to show appropriate upper bounds for epsilon one and epsilon two. To upper bound the collision probability, we consider structure graphs. Those represent the message walks where vertices are state values and edges are transitions from one state value to the subsequent one. Labels are the block values of TI, II. A cycle represents a collision. We define a number of bad walks that will represent the options in a single message to produce a collision. We distinguish between multiple cases depending on the size of the prefix and are the size of the cycle. In the first case, we consider a structure graph that has a prefix and a cycle of length exactly one edge. In the second case, we consider a walk that has no prefix and again a single edge cycle. In the third case, has an existing prefix and a cycle of length at least two edges. Finally, we consider a bad structure graph that collides with the beginning. In the first two cases, we have m possible blocks that can lead to a single cycle collision. Therefore, we have m as a factor. In the latter two cases, any two blocks can collide, so we have m choice II as a factor. In the former two cases, we have a single n bit random variable that needs to be hit from an ideal permutation output. Therefore, we have a denominator of 2 to n minus m since the outputs have not collided before and therefore assembled randomly from a set of this size at least. In the second two cases, we have at least two independent random variables. Therefore, the probability for a collision is at most 1 by 2 to the n minus m squared. The sum of all terms yields the following bound among bad walks. We also have to study good walks. Those are walks of two distinct messages that do not collide with themselves as the bad walks instead produce a collision between them. Those messages can have a common prefix. Here we distinguish four cases by the length of their path from the point where both walks deviate until they meet again. In the first case, we have one message that has a diverging path of length at least three edges. We have another case where one walk has a length of two edges and the other one of at least two edges and the difference in their tweaks is non-zero afterwards. We have another case which matches the second case in the length of the diverging path but has a zero difference in delta t after the diverging path. And we have a case where one of the diverging messages walk has only a single edge until they meet again. In all cases arbitrary blocks can collide. Therefore, we have m by 2 as a factor everywhere. Moreover, in all cases we have two independent random variables that must be hit. Since no non-trivial collision has occurred before, they are sampled at random from sets at least 2 to n minus 2m. Since we have two random variables, we have 2 to n minus 2m squared in the denominator in all cases. Finally, since t may be smaller than n, we can have a factor in every term. This leads us to the following bounds for a collision in good walks. Summing up for the collision probability from bad and good walks, we obtain the following upper bound. We conducted a similar study for upper bounding the probability of collisions in only x. Again, we considered good and bad walks. We call walks bad that have a loop in either a single message or a collision in the full x in some blocks between two messages m and m prime. Clearly, non-trivial tweak and input collisions are also collision x when non-trivial means that two messages are not simply identical. Since we considered such full state collisions already before, we can exclude them here and only will give a term for correctness. For both cases of bad walks, arbitrary block indices i and j can collide with each other. Therefore, we have a factor of m choice 2 in both terms. In both cases, we also have a random variable that must be hit where the new input has sampled at random from a set of at least 2 to n minus 2m values. Over all messages, this will become sigma again and we will have the following upper bound for the probability of bad walks. On the other hand, we studied also good walks. Here, two messages collide in x without any bad events. We distinguish between two cases. The difference in the checksum data is either 0 or not. If it is not equal to 0, then we need a certain output difference from the last primitive call. Since the input was not due to a collision, the probability to hit such a certain output difference is at most 1 by 2 to n minus 2m. In the other case, the difference in the checksum should be 0. Again, for good walks, the inputs of the final primitive call are fresh and the outputs are chosen randomly and independently from a set of size at least 2 to n minus 2m values. Since we truncate x after the output of the last primitive call, we can have a factor that is larger than 1 if t is smaller than n. We did not have that factor for the bad walks since there we had considered a collision in the full primitive outputs. Here, we obtain a probability as shown here. Finally, we obtain the following bound for truncated almost universality of our construction. And then, in sum, we can add all terms to obtain the following bound of the PRF security for DAVMAC with IDE primitives. This corresponds to a minimum of n or n plus t half bits of security. We also implemented our scheme. As for the original ZMAG, it is beneficial to use an efficient tweakable block sulfur. Moreover, a long tweak input is good when a tweak schedule is efficient. The OXSPC or skinny appeared as natural choices of a primitive. We implemented our construction with skinny64128 on two AVR microcontrollers that are widespread. An addMega2560 and an addMega328P. We chose the existing implementation of skinny for AVR as a basis and adapted it for our MAC. Since our motivating construction for comparison was ZMAG, we also implemented the same variant of skinny in ZMAG 1. So the variant by NITO in 2018, which replaced the more complex original finalization also with hashed NTPC. Our goal was to have lower state sizes at the end. We used an existing approach of filling stack and RAM with random values in advance to see how much of them were changed to identify how much RAM was used. While we did not achieve the smallest possible footprint in fully space optimized implementations, we could reduce the space for the mask and the accumulators. More optimizations are certainly possible, for example, by avoiding functions and only have code without them. We tried that both implementations are comparable. We also obtained a slightly faster implementation for DAFMEG, however, this was not really our goal. Our code is publicly available and can be compared and optimized further. In conclusion, we proposed DAFMEG, a sequential variant of ZMAG with a high rate of N plus T bits per primitive call. It uses both the message and the tweak input to process the message material. We could achieve a high security of the minimum of N and N plus T half bits without any nonces or random values. DAFMEG could be easily extended to variable output lengths, however, this is not an innovation here. We used two keys, but a single bit fixing or a single tweak bit for domain separation could yield a single key variant. There are certain limitations of our design that we do not want to hide. The checksum at the end is necessary to obtain high security. We propose in our work that it is possible to add the value of the checksum as a final message block. However, we note that this has to be done with caution since tampering with this value can lead to a security reduction to only the birthday pound. Since our work, we observed that simpler and smaller high rate schemes have appeared. For example, COCB and COTR by Bauer et al. or Romulus by Iwata et al. and AETLR very recently by Google et al. Then this lightweight competition has motivated some of them. They also exploit both the message and the tweak input to process much message material in a single primitive call. Their design are actually ways of how to process associated data and not how to encrypt since they are authenticating encryption schemes. Here we sketch them all in an abstract way how they authenticate all. Their designs are smaller than our proposal, which is actually great. And for less, we stress that they need unknowns. Otherwise, the security is always limited by the birthday pound. Much of the hassle and the higher size of our construction compared to those was needed by the fact that we explicitly targeted a stateless deterministic design, so a nonce and random value-free design with beyond-birthday bound security. Therefore, we fully acknowledged their efforts and let designers choose the way they wanted. This is so far our proposal and we thank you for your attention.


Hello and welcome to this presentation of the STM32L4 Firewall. It covers the main features of this system IP used to secure sensitive code and data. Here is an overview of the firewall's implementation and its benefits for customer applications. The firewall protects the access to sensitive code and data located in the flash memory or SRAM1 segments from external processes. Any attack detected by the firewall causes the MCU to reset if the firewall is enabled. The firewall monitors each access from the AHB masters to the flash memory or SRAM1 AHB slaves, then depending on the firewall configuration allows the access to the memory segment or resets the MCU if not allowed. Having part of the code and data monitored by the firewall allows users to protect their IP, meaning a third party's intellectual property of embedded software can be protected against code dumping along with any sensitive data stored in SRAM1. Each memory segment protected by the firewall is configured independently with a start address and the associated length of the segment. The three definable memory segments are the code segment, the volatile data segment, and the non-volatile data segment. The firewall is based on a call gate mechanism used to open the access to these protected segments. The call gate function is the single entry point able to open the firewall and enable access to the protected segments. To ensure sensitive, volatile data is erased before returning back to non-protected user code, the call gate mechanism specifies the exact exit point when jumping back from the protected code segment. The goal is to detect any non-expected code branches and to react by resetting the MCU. To guarantee a minimum level of protection, once the firewall is enabled, it remains active until the next MCU system reset. The firewall is based on three states to ensure a dynamic protection of the secure segments. The idle state is the default state when the firewall is not enabled. In this state, the AHB memory bus is not monitored. When enabled, the firewall enters closed state and all access to the protected segments is prohibited. The correct call gate entry sequence by non-protected executing code switches the firewall to the open state. The protected code can now be executed and access to non-volatile and volatile data segments is allowed. As soon as an instruction fetch is executed, jumping back to the non-protected code area, the firewall switches back to closed state. Once closed, all access to the secure areas except for the call gate mechanism are killed by an MCU reset. The firewall's call gate function architecture offers the best solution for building a secure entry and exit point to the protected memory areas. The call gate function is located in the protected code segment at a mandatory fixed address corresponding to the code segment start address plus four, scatter file for keel, pragma setup for IAR. The FPA bit has to be cleared immediately in the call gate in order to stop any intrusion that exits the protected code in a non-protected user area when not expected. Before leaving the protected code area in execution, it is recommended to clean and clear the context or variables data and the CPU registers before requesting the exit sequence and jumping back to the non-protected instruction. The type of access to the protected segments depends on the firewall state. When it is closed, any access to the protected area generates a system reset. When the firewall is open, some access is possible. In the code segment, flash memory, read operations and instruction fetches are allowed. In the non-volatile data segment, flash memory, read and write operations are allowed. In the volatile data segment SRAM-1, read, write and execute operations are allowed if the SRAM-1 segment is declared as shared or executable. When the firewall is disabled or closed, there is no protection. Specific constraints must be respected when enabling the firewall. Interrupts must be disabled from the call gate entry sequence until the firewall switches back to the closed state. If an interrupt service routine or ISR occurs, the firewall generates a reset. All DMA access to and from the protected segments is not allowed and is rejected by the firewall system reset. The application benefits are mainly to detect an intrusion faster during the protected code execution and to offer a very high level of protection against code dumping using the DMA. Complimenting the firewall protection, it is required to set the PC Rop or proprietary code readout protection for the protected code segment in the flash memory. Setting the PC Rop stops any code from being dumped by the debugger during the development phase by external attacks or from an IAP attack. The PC Rop protection mechanism on the STM32L4 is improved over the previous STM32F2, F4 and L1 microcontrollers. STM32L4 microcontrollers make it possible to define start and end regions and there is an option byte which allows a mass erase operation but keeps the PC Rop segment protected. In production, ST recommends setting the STM32 readout protection or RDP to level 2 which disables the JTAG link to the MCU. Setting the RDP to level 2 secures the MCU against any external attacks to the protected segments. ST also recommends enabling write protection on the reset vector and the firewall configuration to prevent any unwanted write operations to the protected areas. In addition to this training, you can refer to the STM32L4 system memory protection training for more information.


Purple-urple found a new place, and this one looked much better. This place had some color. She scampered over to some little green creatures to find out more. We're all going over there, the green creature told her. We're all combining ourselves into a single color, isn't it great? Do I still get to be purple? Asked Purple-urple. We all give up our color to join this great melting pot. We leave our colors at the door. Purple-urple never wanted to stop being purple. That's her favorite part about herself. But she didn't want to be alone. But being with other people who wouldn't let her be her wasn't worth it. She knew this place wasn't for her, so she kept going on her journey to find a place to belong.


Hello everybody, my name is Alexandra. I work for GIZ Global Project on mainstreaming ecosystem-based adaptation, and GIZ is hosting this year's NBS theme and the CBA. I would quickly like to give you a sneak preview on what's awaiting you during the week of the CBA. As you may have noticed, the NBS theme is focusing on food systems, and here we really want to explore how to redefine the roles of local communities and their implementation and planning of climate change adaptation within the context of the food system. And many organizations have come together and create three really exciting sessions for you. There's one session, the first one on June 15th actually, that will discuss the question, how local communities can be put in the driver's seats to create and support climate-resilient food systems. And that's a session that's prepared by ICAD and by the Instituto de Montaña with contributions from University of Oxford, from the NBS network, from IUCN, and many others. On June 16th, we are going to discuss the question, how to effectively communicate EBA and food security and what tools and methods are actually available to communicate the effectiveness of EBA. You're going to learn about story maps and storytelling and other exciting tools that can be used. This session is organized by Conservation South Africa, TMG, and Water. And then another session on June 16th is about how different knowledge systems can be combined. So the local, the traditional, and the scientific knowledge system, how can they be combined to strengthen a transformation of the food system towards NBS? And its session is organized by the practical action, by the German Aerospace Center and by the University of Uganda and the Hunger Project. So overall, I think the CBA and the NBS theme provides plenty of room to engage with practitioners around the world, and you shouldn't miss it, and we're looking forward to have you there.


Major sponsors for Ableton on Air include Washington County Mental Health, where hope and support come together. Media sponsors for Ableton on Air include Park Chester Times, Muslim Community Report, www, this is the Bronx.info, Associated Press Media Editors, New York Power Online Newspaper, U.S. Press Corps Domestic and International, Anchor FM, and Spotify. Partners for Ableton on Air include the HOD of New York and New England, where everyone belongs, the Orthodox Union, the Division for the Blind and Visually Impaired of Vermont, the Vermont Association for the Blind and Visually Impaired, Central Vermont Habitat for Humanity, Montefiore Medical Center of the Bronx, Rose of Kennedy Center of Bronx, New York, Albert Einstein College of Medicine of the Bronx. Ableton on Air has been seen in the following publications. Park Chester Times, www, this is the Bronx.com, New York Power Online Newspaper, Muslim Community Report, www.h.com, and the Montpelier Bridge. Ableton on Air is part of the following organizations, the National Academy of Television, Arts and Sciences, Boston, New England Chapter, and the Society of Professional Journalists. Welcome to the edition of Ableton on Air, the one and only program that focuses on the needs, concerns, and achievements of the different label. I've always been your host, Lauren Seiler. Before we get to today's topic, we'd like to say special thanks to Washington County Mental Health and other agencies that have helped promote Ableton on Air, including the Association for the Blind Vermont, the Division for the Blind Vermont, Hireability, and many other agencies that have helped Ableton on Air through the years and through these last couple of months. Arlene is not here today. She is recuperating in the hospital, and we wish her a speedy recovery. I'm Lauren Seiler. On today's topic, we will talk about a radio program in Argentina and other mental health services and resources that I'm going to give you. Let's talk about a special radio program in Argentina called Radio La Califata. Radio La Califata, which I'm just letting you know and don't take this offensively, but Califata in Spanish means it's called The Crazy Woman. So Radio La Califata, The Crazy Woman, is the world's first radio station broadcast inside a mental hospital, a non-commercial radio station and was founded at La Borda Psychologist. La Borda is a hospital in Argentina and it was founded by psychologist Alfredo Oliveira in 1990. Oliveira began recording patients' discussions centered around a particular theme and transmitted the recording on the radio, which listeners called in responses. And these psychiatric patients in a makeshift studio, support comes from Argentine announcer Leo LaLomir and the Argentine footballer Oscar Ruggan. Programming includes sports and the Borda Tangle Club. The station produces micro-programs of four hours a week, which are distributed in dozens of radio stations, both in Argentina and Latin America. Psychiatric facilities in other countries, such as Argentina, Chile, Germany, Spain and Uruguay, have subsequently developed similar programs. And let's go up here in terms of La Califata. So it's a radio program done by psychiatric patients, but the history of the psychiatric hospital in which it's part of is called Hospital Interdisciplinario, which means Interdiscipline Hospital of Tibercio Borda, nicknamed El Borda, is the largest and most notable psychiatric hospital in Argentina. Situated on top of a hill next to a child and adolescent neuropsychiatric hospital, which is called Garcia Tobar. Now, in terms of La Califata, let's look that up and get more information about the radio station. Okay, so here we go. Tell you where it's broadcasted. Okay, so it's broadcasted in Buenos Aires. So let's go here. There's a documentary for those that would like to know more about it. You can go to www.imdb.com, and there is a documentary about the radio station La Califata, which is spelled C-O-L-I-F-A-T-A. It's a radio station run entirely by the patients of JT Borgo psychiatric hospital in Buenos Aires. Recorded and broadcasted from the hospital gardens, it is heard all over the world, and it is a station that questions the limit between madness and reason. We are not making fun of people that have gotten psychiatric help or help from mental challenges, but there are ways to deal with anger and there are ways to deal with mental challenges by doing radio and doing television, you know, to be part of society and as part of work. So this documentary is about one hour and 33 minutes, so it is recorded in Buenos Aires, recorded and broadcasted from the hospital gardens, it is heard all over the world, and it's a station that questions the limit between madness and reason. The station that breaks down a dividing wall between sane and mad, it gives the word, let's go down here, it breaks down a dividing wall between sane and mad and it gives the word, it gives the word to those of voice that have been denied for too long. The mad or people that have mental challenges, it shows us many things and we, the sane are incapable of seeing. This was a, someone that wrote about the movie. So more information on radio like callifatta and the documentary, you can go to www.imdb.com. And let's go here. I'm going to go to YouTube and point out parts of the documentary. Oops. Okay. So let's also go to the callifatta. The actual radio station has a YouTube channel. So I'm going to click here on, we're going to stop this for a minute. Stopping the video. There is a trailer that was produced by the callifatta and you can go on YouTube for more information on that. You can go to www.youtube.com forward slash the callifatta. But it also can be seen, the callifatta can be seen on internet radio as well. So I'm going to get that piece so you can know when or where to, here we go. I got it. I got the actual page. Okay. So the callifatta, you can go to on screen. You'll see their website. So radio callifatta that C-O-L-I-F-A-T-A-H-A. The callifatta is a non-governmental organization classified under civil association, the callifatta mental health and communication that develops activities in the area of investigation and mental health services, utilizing media to create spaces of help. The radio station is commonly known as LT-22 radio. The callifatta is a radio station that is current and former internal patients of the border hospital, B-O-R-D-A hospital in Buenos Aires, Argentina. And it is the first radio station to air within a psychiatric hospital. So if you want to find out about the callifatta, you can go to www.locallifatta.com forward slash Argentina or AR for Argentina. So the callifatta is L-A-C-O-L-I-F-A-T-A.com forward slash AR. So you can go to the following link. And as you go up top here, there is a bar home institute. It talks about the institution, the programs, the radio station, so on and so forth. And the callifatta is located. If you want to find out more information on that radio program, the address is Buenos Aires, Argentina. So it is Ferre Abeliers, 3740 D-P-T-O, Goliath, Audemars, Buenos Aires, Argentina. And you can email them at locallifatta at gmail.com. And we can go down if you want to find out more about them during English and Spanish. And they also have the callifatta TV. So if you want to find out more information, let's actually go to the TV page. It's in Spanish, but there's also English as well. And you can look at different videos. So for more information on locallifatta, you can go to www.locallifatta.com forward slash AR for Argentina. During this show, we're going to be giving more information on services of mental health. We cannot make fun of anyone that has mental health issues. As a matter of fact, since we're talking about radio and buzzwords and all that kind of thing.  Okay, so there are certain words here that some you can use, some you can't.  Well, that's, let me see, that's a source, but that's words not to use mental challenge. Okay, there are certain words not to use around with someone with a mental challenge. I'm getting to that. 250 labels, according to the National Institute of Medicine and Health, there's 250 labels used to stigmatize people with mental illness. We must avoid certain things in certain words and certain stigmas.  Okay, the following words, do not use the following words. Do not use disturb, nuts, confused, psycho, spastic, crazy, depressed, disabled, mad, unpredictable, insane, loony or mental. Do not use just plain ill, do not use loony bin, do not say a person has a screw loose, do not say the person is stressed, do not say the person is brain dead, demanding or demented. Do not use the word freak, weird, screw loose, especially confused, do not say the person is dumb, so on. So if you want to find out more information on the words not to use, you can go to www.ncbi.nlm. This is the actual, let's go up, it's the National Institute of Health, Library and Medicine with Biotechnology Information. So this is a library that you can find out more information on what words to use and what not to use for the National Institutes of Health. Today's show is basically more information on mental illness and other ways to control, I'm not saying control your mental illness, but ways that you can use it to your advantage to educate people. So we have Ableton on Air here in Vermont and other places have, especially with La Califata, which is at 100.2 internet radio in Argentina. It is a program that people with psychiatric challenges are using it to educate people. So we should not make fun at all of people with mental and physical challenges because that's not the way we advocate and that's not the way we help people. So for more information on La Califata, you can go to www.lacalifata.com and .org. Let's look it up again. So La Califata, so radio La Califata is www.lacalifata.com forward slash A-R. Look up their radio program and listen to their radio program because they also have a TB show. And for more information on any mental health program or services here in Vermont, you can go to www.wcmhs.org. That's Washington County Mental Health who sponsors Ableton on Air. For more information on Ableton on Air and anything that you have seen on today's program about mental health services, you can go to www.orgamedia.net. That's Ableton on Air. Again, thank you for joining us on this edition of Ableton on Air. Here today, please look and listen to that radio show La Califata.  They are our friends and they will be helping to promote Ableton on Air as well. Just to let you know that Ableton on Air will also, and we will give you more information as the weeks progress, Ableton on Air will be having our own internet radio program and radio station. And we will be doing that as part of Ableton on Air here in the studio with our internet radio as well as Ableton on Air. So for more information on Ableton on Air, again, you can go to www.orgamedia.net. I'm Lawrence Seiler. See you next time. Major sponsors for Ableton on Air include Washington County Mental Health, where hope and support come together. Media sponsors for Ableton on Air include Park Chester Times, Muslim Community Report, www, this is the Bronx.info, Associated Press Media Editors, New York Powered Online Newspaper, U.S. Press Corps, Domestic and International, Anchor FM and Spotify. Partners for Ableton on Air include Yehad of New York and New England, where everyone belongs, the Orthodox Union, the Division for the Blind and Visually Impaired of Vermont, the Vermont Association for the Blind and Visually Impaired, Center Vermont Habitat for Humanity, Montefere Medical Center of the Bronx, Rose of Kennedy Center of Bronx, New York, Output Einstein College of Medicine of the Bronx. Ableton on Air has been seen in the following publications. Park Chester Times, www, this is the Bronx.com, New York Powered Online Newspaper, Muslim Community Report, www.h.com and the Montpelier Bridge. Ableton on Air is part of the following organizations. The National Academy of Television, Arts and Sciences, Boston, New England Chapter and the Society of Professional Journalists.