#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1996

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Bibliography 85 ii Acknowledgments My foremost thanks go to my advisor Jack Lutz. Jack brought me into research in 1999 while I was still an undergraduate. In the four years since he has provided me with excellent research advice and I have thoroughly enjoyed working with him. thank them for collaborating with me. I also thank Pavan Aduri, Cliff Bergman,… (More)

- Clifford Bergman, Jennifer Davidson
- Security, Steganography, and Watermarking of…
- 2005

Steganography is the study of data hiding for the purpose of covert communication. A secret message is inserted into a cover file so that the very existence of the message is not apparent. Most current steganography algorithms insert data in the spatial or transform domains; common transforms include the discrete cosine transform, the discrete Fourier… (More)

- George T. Amariucai, Clifford Bergman, Yong Guan
- RFIDSec
- 2011

This paper introduces the Adopted-Pet (AP) protocol, an automatic (i.e. requiring no human interaction) secure pairing protocol, adequate for the pairing between a passive RFID tag and a reader. Most pairing protocols rely for their security on a certain advantage that the legitimate devices have over any malicious users. Such advantages include proximity… (More)

- Clifford Bergman, Giora Slutzki
- SIAM J. Comput.
- 2000

In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B satisfy precisely the same identities? (2) Do they satisfy the same quasi-identities? (3) Do A and B have the same set of term operations? In addition to the general case in which… (More)

- Clifford Bergman, David Juedes, Giora Slutzki
- IJAC
- 1999

Two algebraic structures with the same universe are called term-equivalent if they have the same clone of term operations. We show that the problem of determining whether two finite algebras of finite similarity type are term-equivalent is complete for deterministic exponential time. When are two algebraic structures (presumably of different similarity… (More)

This paper considers the lattice of subquasivarieties of a regular variety. In particular we show that if V is a strongly irregular variety that is minimal as a quasivariety, then the smallest quasivariety containing both V and Sl (the variety of semilattices) is never equal to the regularization Ṽ of V. We use this result to describe the lattice of… (More)

Hiding messages in image data, called steganography, is used by criminals and noncriminals alike to send information over the internet. The detection of hidden messages in image data stored on websites and computers, called steganalysis, is of prime importance to cyber forensics. Automated detection of hidden messages is a requirement, since the shear… (More)

A congruence relation θ on an algebra A is fully invariant if every endomorphism of A preserves θ. A congruence θ is verbal if there exists a variety V such that θ is the least congruence of A such that A/θ ∈ V. Every verbal congruence relation is known to be fully invariant. This paper investigates fully invariant congruence relations that are verbal,… (More)

Two algebraic structures A and B are called categorically equivalent if there is a functor from the variety generated by A to the variety generated by B, carrying A to B, that is an equivalence of the varieties when viewed as categories. We characterize those algebras categorically equivalent to A when A is an algebra whose set of term operations is as… (More)