Skip date selector
Skip to beginning of date selector
April 2024
May 2024
June 2024
July 2024
August 2024
Friday, April 26, 2024
- All dayEarth MonthCelebrate Earth Month throughout the month of April and Earth Day on April 17 from 10 a.m.–1 p.m. with events in Rudder Plaza and the chance to earn prizes and giveaways. Earth Month serves as an arena for sustainability awareness and education. We want everyone to be effective leaders in their environment, whether that is Texas A&M, Bryan, College Station, or at home. Our goal is to expose, educate, and empower attendees with the skills they need to be more sustainable—environmentally, socially, and economically.
- All daySilhouettes & SelfiesTake a selfie alongside one of the implied action silhouettes, or gather a group of your fellow Aggies to photograph a silent flash mob! A bistro vignette will provide the illusion of you having a drink with a friend, while the garden view will set the scene for some work amid the flowers and plants. Celebrate a wedding from the proposal to the ceremony flower arch. Come join the fun!
- All dayTexas A&M University Track and Field at Corky/Crofoot ShootoutTexas A&M University Track and Field at Corky/Crofoot Shootouthttps://admin.12thman.com/calendar.aspx?game_id=21728&sport_id=10 (https://admin.12thman.com/calendar.aspx?game_id=21728&sport_id=10)
- All dayTexas A&M University Track and Field at Penn RelaysTexas A&M University Track and Field at Penn Relayshttps://admin.12thman.com/calendar.aspx?game_id=21727&sport_id=10 (https://admin.12thman.com/calendar.aspx?game_id=21727&sport_id=10)
- All dayThe Art of Texas State ParksFrom the rugged mesas of the Panhandle and the steep-sided mountains of Big Bend Country to the waterways of the Gulf Coast and rolling grasslands of the prairies, visitors will journey through the diverse ecological regions of Texas as interpreted by individual artists. In celebration of 100 years, the Texas Parks and Wildlife Department commissioned 30 Texas artists to depict scenes from parks, natural areas and historic sites in the state park system. The selections on view are as varied as the parks themselves and offer a snapshot of Texas' rich history and ecosystems. This exhibition represents the seventh installation in the Texas Art Project (https://uart.tamu.edu/texasartproject/) series.Organized by The Meadows Center for Water and the Environment at Texas State University, Texas Parks and Wildlife Department, and Stark Galleries. Additional support provided by Texas Parks and Wildlife Foundation and H-E-B.This exhibition includes work from artists such as Randy Bacon, Mary Baxter, David Caton, Charles Criner, Margie Crisp, Ric Dentinger, Fidencio Duran, Janet Eager Krueger, Joel R. Edwards, Malou Flato, Gordon Fowler, Pat Gabriel, David R. Griffin, Brian Grimm, Clemente F. Guzman III, Karl E. Hall, John Austin Hanna, Billy Hassell, Hailey E. Herrera, Lee Jamison, Denise LaRue Mahlke, Jim Malone, Talmage Minter, William B. Montgomery, Kermit Oliver, Noe Perez, Jeri Salter, Jim Stoker, Bob Stuth-Wade, and Terri M. Wells.
- All dayThe Wit & Whimsy of Victorian MajolicaMajolica was introduced at the Great Exhibition of 1851 and quickly became ubiquitous in Victorian England and America, with works appearing in museum displays and royal palaces as well as in the homes of average citizens. As majolica retailed at a cheaper price than porcelain, it was available to a fairly broad range of society and, in Victorian homes, was commonly found in the conservatory or dining room, in the form of tureens and servers, jardinières, teapots, garden seats, plates, and decorative statues. Initially popular in England and the Continent, many British potters and craftspeople immigrating to North America contributed their knowledge and skill to the growing American pottery industry, leading to the large-scale production of majolica. When the lead glazes needed to achieve majolica's shine and vibrancy were outlawed as poisonous to workers, its production all but ceased. This exhibition helps tell the story of majolica and helps to restore its legacy to the history of design.
- All dayTransit Spring ServiceFor service information visit transport.tamu.edu/busroutes (http://transport.tamu.edu/busroutes)
- All dayWhat Lies BeneathInfrared imaging is a non-destructive technique used by art conservators to examine paintings and artworks and detect hidden details under the upper layers such as added paint, underdrawings, and hidden signatures or watermarks. The technique has been used to discover details of artists' creative processes, alterations and reworking. Infrared examination also can be used as a tool to differentiate between certain groups of pigments and inks.
- All dayWhat Lies Beneath the BeadsThis exhibition looks to engage patrons in a short history of art in the Cameroonian culture, while also looking at the symbolism of the female form across all ancient civilizations. With a twist of science, we'll take an in-depth look, utilizing computed tomography (CT) scans, to discover how our Cameroonian beaded Fertility Goddesses were constructed and gain a better understanding of their conservation needs. Come by and see What Lies Beneath the Beads…
- 7:20 AM3hTexas A&M University Men's Golf at SEC Championship - Stroke Play - 3rd RoundTexas A&M University Men's Golf at SEC Championship - Stroke Play - 3rd Roundhttps://admin.12thman.com/calendar.aspx?game_id=21934&sport_id=7 (https://admin.12thman.com/calendar.aspx?game_id=21934&sport_id=7)
- 8:30 AM9h 30mFolio Futures: Editing Early Modern Plays for Tomorrow's AudiencesIn celebration of Texas A&M University's designation as the host institution for the New Variorum Shakespeare (https://newvariorumshakespeare.org/) (NVS) and in continued commemoration of the 400th anniversary of the publication of Shakespeare's First Folio, we are pleased to invite you to our upcoming symposium, Folio Futures: Editing Early Modern Plays for Tomorrow's Audiences, on Friday, April 26 at Texas A&M University-College Station and livestreamed on Zoom. The symposium will bring together scholars from around the world to assess the history of and future possibilities for editing Shakespeare and his contemporaries. Scholars of Shakespeare's works, digital humanists, and NVS editors will discuss the challenges and opportunities of editing in the twenty-first century for new global audiences who read, perform, and teach in a variety of media. The symposium will feature keynote speakers Kristen Abbott Bennett (Associate Professor at Framingham State University) and Eric Rasmussen (Regents Teaching Professor and Foundation Professor of English at the University of Nevada), as well as round-table discussants. For more information about the symposium, including a full schedule of events, please visit the symposium's website (https://liberalarts.tamu.edu/codhr/folio-futures-shakespeare-symposium/). This symposium is free and open to the public thanks to the generous support of our sponsors:Texas A&M College of Arts and Sciences Melbern G. Glasscock Center for Humanities Research Texas A&M Department of English Texas A&M Center of Digital Humanities Research John and Sara Lindsey Chair of Liberal Arts
- 10:00 AM1hInterests-Based Career Assessment WorkshopMatch interests with majors and occupations. Learn more and register online (https://uhs.tamu.edu/mental-health/workshop.html).
- 10:30 AM6h 30mTexas Crypto DayAbstracts ABE for Circuits with poly(λ)-sized Keys from LWEHoeteck Wee (https://ntt-research.com/cis-people/wee-profile/) (NTT Research) We present a key-policy attribute-based encryption (ABE) scheme for circuits based on the Learning With Errors (LWE) assumption whose key size is independent of the circuit depth. Our result constitutes the first improvement for ABE for circuits from LWE in almost a decade, given by Gorbunov, Vaikuntanathan, and Wee (STOC 2013) and Boneh, et al. (EUROCRYPT 2014) – we reduce the key size in the latter from poly(depth, λ) to poly(λ). The starting point of our construction is a recent ABE scheme of Li, Lin, and Luo (TCC 2022), which achieves poly(λ) key size but requires pairings and generic bilinear groups in addition to LWE; we introduce new lattice techniques to eliminate the additional requirements. Joint work with Valerio Cini. Classical Verification of Quantum DepthNai-Hui Chia (https://sites.google.com/view/naihuichia) (Rice University) Verifying if a remote server has sufficient quantum resources to demonstrate quantum advantage is a fascinating question in complexity theory and a practical challenge. One approach is asking the server to solve some classically intractable problem, such as factoring. Another approach is the proof of quantumness protocols. These protocols enable a classical client to check whether a remote server can complete some classically intractable problem and thus can be used to distinguish quantum from classical computers. However, these two approaches mainly focus on distinguishing quantum computers from classical ones. They do not directly translate into ones that separate quantum computers with different quantum resources. In this talk, we want to go one step further by showing protocols that can distinguish machines with different quantum depths. We call such protocols Classical Verification of Quantum Depth (CVQD). Roughly speaking, if a server has quantum circuit depth at most d, the classical client will reject it; otherwise, the classical client will accept it. Note that a malicious server, in general, can use classical computers to cheat. Thus, CVQD protocols shall be able to distinguish hybrid quantum-classical computers with different quantum depths. We will see two CVQD protocols: The first protocol can separate hybrid quantum-classical computers with quantum depth d and d+c (for c some fixed constant) assuming quantum LWE with d rounds. The second protocol is a one-round protocol assuming quantum LWE and the classical random oracle heuristics. Strong Batching for Non-interactive Statistical Zero-KnowledgeShafik Nassar (https://sites.google.com/view/shafiknassar/bio) (UT Austin) A zero-knowledge proof enables a prover to convince a verifier that a statement is true, without revealing anything beyond this fact. By running a zero-knowledge proof k times, it is possible to prove (still in zero-knowledge) that k separate statements are all true. However, this increases the communication by a multiplicative factor of k. Can one do better? In other words, is (non-trivial) zero-knowledge batch verification possible? Previous work of Kaslasi et al. (TCC 2020, Eurocrypt 2021) presented non-trivial batching for problems that have a non-interactive statistical zero-knowledge, but (1) at the cost of introducing interaction and (2) achieved communication that is roughly poly(n)+k, which is non-trivial but still scales linearly with k. In this talk, we show how to overcome both obstacles and achieve non-interactive batching with total communication of poly(n, log k). Joint work with Changui Mu, Ron Rothblum, and Prashant Nalini Vasudevan. Is It Even Possible? On the Parallel Composition of Asynchronous Cryptographic Protocols Pouyan Forghani (Texas A&M University) In the design and analysis of cryptographic protocols it is often assumed an idealized model where the communication is synchronous and messages are always delivered by the start of the next round. However, while substantially simplifying things, hiding environmental nuisances and allowing us to focus on the task at hand, this strong assumption incurs significant overhead in practice. In this talk, we will show that, as opposed to the synchronous setting, well-established techniques for parallel protocol composition completely break in the asynchronous setting. Specifically, we rule out the possibility of any black-box compiler for the parallel composition of arbitrary protocols. On the positive side, we introduce a round-preserving compiler for a restricted class of protocols (which includes all existing asynchronous MPC protocols) that achieves parallel composition in asynchronous networks. Joint work with Ran Cohen, Juan Garay, Rutvik Patel, and Vassilis Zikas. Batch Arguments to NIZKs from One-Way Functions Eli Bradley (UT Austin) Succinctness and zero-knowledge are two fundamental properties in the study of cryptographic proof systems. Several recent works have formalized the connections between these two notions by showing how to realize non-interactive zero-knowledge (NIZK) arguments from succinct non-interactive arguments. Specifically, Champion and Wu (CRYPTO 2023) as well as Bitansky, Kamath, Paneth, Rothblum, and Vasudevan (STOC 2024) recently showed how to construct a NIZK argument for NP from a (somewhere-sound) non-interactive batch argument (BARG) and a dual-mode commitment scheme (and in the case of the Champion-Wu construction, a local pseudorandom generator). The main open question is whether a BARG suffices for a NIZK (just assuming one-way functions). In this talk, I will show that an adaptively-sound BARG for NP together with an one-way function imply a computational NIZK argument for NP. Using complexity leveraging, adaptively-sound BARGs can be based on a sub-exponentially-secure somewhere sound BARG. Taken together, we obtain a NIZK argument for NP from one-way functions and a sub-exponentially-secure somewhere-sound BARG for NP. I then show that if we instead start with public-key encryption instead of one-way functions, then a polynomially-secure somewhere-sound batch argument for NP suffices for the same implication. As a corollary, this means a somewhere-sound BARG can be used to generically upgrade any semantically-secure public-key encryption scheme into one secure against chosen-ciphertext attacks. More broadly, our results demonstrate that constructing non-interactive batch arguments for NP is essentially no easier than constructing NIZK arguments for NP. Joint work with Brent Waters and David J. Wu.
- 12:00 PM1hECCB Departmental Seminar: Alberth Rojas, Meredith Grimshaw and Fabrice KentatchimeThis week's seminar will feature speakers will be Alberth Rojas, ECCB doctoral student, Meredith Grimshaw, ECCB master's student and Fabrice Kentatchime, ECCB doctoral student. Rojas' seminar title is "Does land conservation for tourism preserve local biodiversity at different spatial scales? True or false for herpetofauna in Costa Rica." Grimshaw's seminar title is "Impacts of mercury on the health of black skimmer chicks (Rhynchops niger)". Kentatchime's seminar title is "The route of chimpanzee trafficking in Cameroon: Tracing the origin of resident chimpanzees in rescue and rehabilitation centers."
- 12:30 PM1hCreative AI Artist Talk Series: Dr. Eunsu KangThe Institute for Applied Creativity (IAC) hosts an online talk with Dr. Eunsu Kang, visiting professor, art and machine learning, at Carnegie Mellon University. Register at tx.ag/KJ6VEAv. Zoom details for the event will be sent after registration.
- 2:00 PM1hUnderstanding Worthiness WorkshopThis workshop is designed to help participants begin to understand the concept of worthiness. We will explore this by looking at the areas of self-esteem, self-compassion and perfectionism. Learn more and register online (https://uhs.tamu.edu/mental-health/workshop.html).
- 3:00 PM1hImposter Phenomenon WorkshopThis workshop is designed to help students struggling with productivity or questioning their ability to succeed to recognize the impact of the imposter phenomenon on their well-being and learn strategies to manage and succeed through feelings of imposterism. Learn more and register online (https://uhs.tamu.edu/mental-health/workshop.html).
- 3:00 PM1hPositive Self-Talk Strategies WorkshopThis workshop will help build participants' confidence as we reframe how we talk to ourselves. We will discuss resilience, ways to move forward, and strategies to be kinder to ourselves. Learn more and register online (https://uhs.tamu.edu/mental-health/workshop.html).
- 6:00 PM3hTexas A&M University Baseball vs Georgia - Maroon Out GameTexas A&M University Baseball vs Georgia - Maroon Out GameTV: SEC Network+Radio: 1150 AM/93.7 FM, TAMU Sports NetworkStreaming Video: https://www.espn.com/watch/player/_/id/b1845c0d-f3fb-4aaf-b548-7993f2210e19 (https://www.espn.com/watch/player/_/id/b1845c0d-f3fb-4aaf-b548-7993f2210e19)Streaming Audio: https://admin.12thman.com/showcase?Live=5291 (https://admin.12thman.com/showcase?Live=5291)https://admin.12thman.com/calendar.aspx?game_id=21659&sport_id=1 (https://admin.12thman.com/calendar.aspx?game_id=21659&sport_id=1)
- 7:00 PM1hUniversity Wind Symphony in ConcertUniversity Wind Symphony in Concert All concerts are live streamed at http://tx.ag/MUSALive (http://tx.ag/MUSALive) $5.00 General Admission Free with a current TAMU student ID Tickets available at the MSC Box Office of scan here: