Sciweavers

915 search results - page 128 / 183
» Proof labeling schemes
Sort
View
TYPES
2004
Springer
14 years 1 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
IWSOC
2003
IEEE
104views Hardware» more  IWSOC 2003»
14 years 1 months ago
IP Watermarking Techniques: Survey and Comparison
— Intellectual property (IP) block reuse is essential for facilitating the design process of System-on-a-Chip. Sharing IP blocks in such a competitive market poses significant h...
Amr T. Abdel-Hamid, Sofiène Tahar, El Mosta...
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
14 years 13 days ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
14 years 12 days ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
14 years 6 days ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen