Thomas J. Peters
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Thomas J. Peters has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Kirk E. Jordan
IBM Research - Thomas J. Watson Research Center
5 shared publications - Ji Li
Department of Mathematics University of Connecticut 196 Auditorium Road Unit 3009 06269 Storrs CT
3 shared publications - Alexander Russell
University of Connecticut
2 shared publications - D. Marsh
Pratt and Whitney
2 shared publications - David William Rosen
George W, Woodruff School of Mechanical Engineering, Georgia Institute of Technology, Atlanta, USA
2 shared publications J. A. Roulier
Department of Computer Science and Engineering Univeristy of Connecticut Storrs
2 shared publications
Latest Publications
- Open Access
- 29 March 2024
- Published by American Chemical Society (ACS) in ACS Omega
- Vol. 9 (14) , 16084-16088
Topological “Shape” in Micellar Dynamics
For micelles, "shape" is prominent in rheological computations of fluid flow, but this "shape" is often expressed too informally to be useful for rigorous analyses. We formalize topological "shape equivalence" of micelles, both globally and locally, to enable visualization of computational fluid dynamics. Although topological methods in visualization provide significant insights into fluid flows, this opportunity has been limited by the known difficulties in creating representative geometry. We present an agile geometric algorithm to represent the micellar shape for input into fluid flow visualizations. We show that worm-like and cylindrical micelles have formally equivalent shapes, but that visualization accentuates unexplored differences. This global-local paradigm is extensible beyond micelles.
- 29 March 2024
- Published by American Chemical Society (ACS) in ACS Omega
- Vol. 9 (14) , 16084-16088
Open AccessTopological “Shape” in Micellar Dynamics
For micelles, "shape" is prominent in rheological computations of fluid flow, but this "shape" is often expressed too informally to be useful for rigorous analyses. We formalize topological "shape equivalence" of micelles, both globally and locally, to enable visualization of computational fluid dynamics. Although topological methods in visualization provide significant insights into fluid flows, this opportunity has been limited by the known difficulties in creating representative geometry. We present an agile geometric algorithm to represent the micellar shape for input into fluid flow visualizations. We show that worm-like and cylindrical micelles have formally equivalent shapes, but that visualization accentuates unexplored differences. This global-local paradigm is extensible beyond micelles.
- 27 February 2022
- Published by Springer Nature
- p. 615-646
Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
- 27 February 2022
- Published by Springer Nature
- p. 615-646
Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
- Open Access
- 7 May 2020
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- p. 6-42
Towards Low-Energy Leakage-Resistant Authenticated Encryption from the Duplex Sponge Construction
The ongoing NIST lightweight cryptography standardization process highlights the importance of resistance to side-channel attacks, which has renewed the interest for Authenticated Encryption schemes (AEs) with light(er)-weight sidechannel secure implementations. To address this challenge, our first contribution is to investigate the leakage-resistance of a generic duplex-based stream cipher. When the capacity of the duplex is of c bits, we prove the classical bound, i.e., ≈ 2c/2, under an assumption of non-invertible leakage. Based on this, we propose a new 1-pass AE mode TETSponge, which carefully combines a tweakable block cipher that must have strong protections against side-channel attacks and is scarcely used, and a duplex-style permutation that only needs weak side-channel protections and is used to frugally process the message and associated data. It offers: (i) provable integrity (resp. confidentiality) guarantees in the presence of leakage during both encryption and decryption (resp. encryption only), (ii) some level of nonce misuse robustness. We conclude that TETSponge is an appealing option for the implementation of low-energy AE in settings where side-channel attacks are a concern. We also provides the first rigorous methodology for the leakage-resistance of sponge/duplex-based AEs based on a minimal non-invertibility assumption on leakages, which leads to various insights on designs and implementations.
- 7 May 2020
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- p. 6-42
Open AccessTowards Low-Energy Leakage-Resistant Authenticated Encryption from the Duplex Sponge Construction
The ongoing NIST lightweight cryptography standardization process highlights the importance of resistance to side-channel attacks, which has renewed the interest for Authenticated Encryption schemes (AEs) with light(er)-weight sidechannel secure implementations. To address this challenge, our first contribution is to investigate the leakage-resistance of a generic duplex-based stream cipher. When the capacity of the duplex is of c bits, we prove the classical bound, i.e., ≈ 2c/2, under an assumption of non-invertible leakage. Based on this, we propose a new 1-pass AE mode TETSponge, which carefully combines a tweakable block cipher that must have strong protections against side-channel attacks and is scarcely used, and a duplex-style permutation that only needs weak side-channel protections and is used to frugally process the message and associated data. It offers: (i) provable integrity (resp. confidentiality) guarantees in the presence of leakage during both encryption and decryption (resp. encryption only), (ii) some level of nonce misuse robustness. We conclude that TETSponge is an appealing option for the implementation of low-energy AE in settings where side-channel attacks are a concern. We also provides the first rigorous methodology for the leakage-resistance of sponge/duplex-based AEs based on a minimal non-invertibility assumption on leakages, which leads to various insights on designs and implementations.
- Open Access
Knot Morphing Algorithm for Quantum `Fragile Topology'
A knot theoretic algorithm is proposed to model `fragile topology' of quantum physics.
Open AccessKnot Morphing Algorithm for Quantum `Fragile Topology'
A knot theoretic algorithm is proposed to model `fragile topology' of quantum physics.
- Open Access
- 1 April 2019
- Published by Universitat Politecnica de Valencia in Applied General Topology
- Vol. 20 (1) , 251-264
Exact computation for existence of a knot counterexample
Previously, numerical evidence was presented of a self-intersecting Bezier curve having the unknot for its control polygon. This numerical demonstration resolved open questions in scientic visualization, but did not provide a formal proof of self-intersection. An example with a formal existence proof is given, even while the exact self-intersection point remains undetermined.
- 1 April 2019
- Published by Universitat Politecnica de Valencia in Applied General Topology
- Vol. 20 (1) , 251-264
Open AccessExact computation for existence of a knot counterexample
Previously, numerical evidence was presented of a self-intersecting Bezier curve having the unknot for its control polygon. This numerical demonstration resolved open questions in scientic visualization, but did not provide a formal proof of self-intersection. An example with a formal existence proof is given, even while the exact self-intersection point remains undetermined.
- 1 June 2016
- Published by Elsevier in Topology and its Applications
- Vol. 206, 276-283
Computational topology: Isotopic convergence to a stick knot
- 1 June 2016
- Published by Elsevier in Topology and its Applications
- Vol. 206, 276-283
Computational topology: Isotopic convergence to a stick knot
- 1 June 2015
- Published by Elsevier in Topology and its Applications
- Vol. 188, 91-96
Topological subtleties for molecular movies
- 1 June 2015
- Published by Elsevier in Topology and its Applications
- Vol. 188, 91-96
Topological subtleties for molecular movies
- Open Access
Computational Topology for Approximations of Knots
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum of total curvature and derivative. High degree Bezier curves are often used as smooth representations, where computational efficiency is a practical concern. Subdivision can produce PL approximations for a given B\'ezier curve, fulfilling the above two conditions. The primary contributions are: (i) a priori bounds on the number of subdivision iterations sufficient to achieve a PL approximation that is ambient isotopic to the original Bezier curve, and (ii) improved iteration bounds over those previously established.
Open AccessComputational Topology for Approximations of Knots
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum of total curvature and derivative. High degree Bezier curves are often used as smooth representations, where computational efficiency is a practical concern. Subdivision can produce PL approximations for a given B\'ezier curve, fulfilling the above two conditions. The primary contributions are: (i) a priori bounds on the number of subdivision iterations sufficient to achieve a PL approximation that is ambient isotopic to the original Bezier curve, and (ii) improved iteration bounds over those previously established.
- Open Access
- 29 July 2013
- Published by Universitat Politecnica de Valencia in Applied General Topology
- Vol. 13 (2) , 115-134
Computational Topology Counterexamples with 3D Visualization of Bézier Curves
Computational Topology Counterexamples with 3D Visualization of Bézier Curves
- 29 July 2013
- Published by Universitat Politecnica de Valencia in Applied General Topology
- Vol. 13 (2) , 115-134
Open AccessComputational Topology Counterexamples with 3D Visualization of Bézier Curves
Computational Topology Counterexamples with 3D Visualization of Bézier Curves
- Open Access
Angular Convergence during Bezier Curve Approximation
Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to the curve in distance . The exterior angles of PL curves under subdivision are shown to converge to 0 at the rate of $O(\sqrt{\frac{1}{2^i}})$, where i is the number of subdivisions. This angular convergence is useful for determining self-intersections and knot type.Open AccessAngular Convergence during Bezier Curve Approximation
Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to the curve in distance . The exterior angles of PL curves under subdivision are shown to converge to 0 at the rate of $O(\sqrt{\frac{1}{2^i}})$, where i is the number of subdivisions. This angular convergence is useful for determining self-intersections and knot type.