More Like this

1. Optically heralded microwave photon addition

   https://doi.org/10.1038/s41567-023-02129-w  

   Jiang, Wentao; Mayor, Felix M.; Malik, Sultan; Van Laer, Raphaël; McKenna, Timothy P.; Patel, Rishi N.; Witmer, Jeremy D.; Safavi-Naeini, Amir H. (July 2023, Nature Physics)
2. Lethe: Secure Deletion by Addition

   https://doi.org/10.1145/3578353.3589541  

   Chou, Eugene; Conrad-Shah, Leo; Barker, Austen; Quinn, Andrew; Miller, Ethan L.; Long, Darrell D. (May 2023, 3rd Workshop on Challenges and Opportunities of Efficient and Performant Storage Systems (CHEOPS ’23))

   Modern data privacy regulations such as GDPR, CCPA, and CDPA stipulate that data pertaining to a user must be deleted without undue delay upon the user’s request. Existing systems are not designed to comply with these regulations and can leave traces of deleted data for indeterminate periods of time, often as long as months. We developed Lethe to address these problems by providing fine-grained secure deletion on any system and any storage medium, provided that Lethe has access to a fixed, small amount of securely-deletable storage. Lethe achieves this using keyed hash forests (KHFs), extensions of keyed hash trees (KHTs), structured to serve as efficient representations of encryption key hierarchies. By using a KHF as a regulator for data access, Lethe provides its secure deletion not by removing the KHF, but by adding a new KHF that only grants access to still-valid data. Access to the previous KHF is lost, and the data it regulated securely deleted, through the secure deletion of the single key that protected the previous KHF. 

   more » « less
3. Searching for differential addition chains

   https://doi.org/10.1007/s40993-024-00604-8  

   Bernstein, Daniel J; Cottaar, Jolijn; Lange, Tanja (June 2025, Research in Number Theory)

   The literature sometimes uses slow algorithms to find minimum-length continued-fraction differential addition chains to speed up subsequent computations of multiples of points on elliptic curves. This paper introduces two faster algorithms to find these chains. The first algorithm prunes more effectively than previous algorithms. The second algorithm uses a meet-in-the-middle approach and appears to have a limiting cost exponent below 1 

   more » « less
4. Minimal Edge Addition for Network Controllability

   https://doi.org/10.1109/TCNS.2018.2814841  

   Chen, Ximing; Pequito, Sergio; Pappas, George J.; Preciado, Victor M. (March 2019, IEEE Transactions on Control of Network Systems)
5. Enantioselective Addition of Pyrazoles to Dienes**

   https://doi.org/10.1002/anie.202105679  

   Jiu, Alexander Y.; Slocumb, Hannah S.; Yeung, Charles S.; Yang, Xiao‐Hui; Dong, Vy M. (August 2021, Angewandte Chemie International Edition)

   Abstract We report the first enantioselective addition of pyrazoles to 1,3‐dienes. Secondary and tertiary allylic pyrazoles can be generated with excellent regioselectivity. Mechanistic studies support a pathway distinct from previous hydroaminations: a Pd⁰‐catalyzed ligand‐to‐ligand hydrogen transfer (LLHT). This hydroamination tolerates a range of functional groups and advances the field of diene hydrofunctionalization. 

   more » « less