Filters








40 Hits in 9.0 sec

Identity-Embedding Method for Decentralized Public-Key Infrastructure [chapter]

Hiroaki Anada, Junpei Kawamoto, Jian Weng, Kouichi Sakurai
2015 Lecture Notes in Computer Science  
This embedded public key of the second cryptosystem is used by the candidate public-key owner that he certainly knows the secret key that corresponds to the public key of the first cryptosystem.  ...  A public key infrastructure (PKI) is for facilitating the authentication and distribution of public keys.  ...  Upper bounds of the length of embeddable string I have been provided by Graham and Shparlinski [9] , Meng [16] and Kitahara et al. [13] .  ... 
doi:10.1007/978-3-319-27998-5_1 fatcat:u2qywwp4bjby3fj6xtx2zhwr3i

On the Security of the Pre-shared Key Ciphersuites of TLS [chapter]

Yong Li, Sven Schäge, Zheng Yang, Florian Kohlar, Jörg Schwenk
2014 Lecture Notes in Computer Science  
When proving security in the standard model, both KPW and KSS assume that the public key encryption system used for key exchange in TLS-RSA is IND-CCA secure.  ...  ii) strong idealizations such as the modeling of TLS's key derivation function as a random oracle [3] or assuming that the public-key encryption scheme in TLS-RSA is substituted with a IND-CCA secure one  ...  We would like to thank Kenny Paterson and the anonymous referees for their valuable comments and suggestions.  ... 
doi:10.1007/978-3-642-54631-0_38 fatcat:lurcrhjyvnel3powc657mav5hq

A Survey of Timing Channels and Countermeasures

Arnab Kumar Biswas, Dipak Ghosal, Shishir Nagaraja
2017 ACM Computing Surveys  
The advances in information theory and the availability of high performance computing systems interconnected by high speed networks, have spurred interest and development of various types of timing channels  ...  A timing channel is a communication channel that can transfer information to a receiver/decoder by modulating the timing behavior of an agent.  ...  Sellke et al. have given two lower bounds and an upper bound on the capacity of Bounded Service Timing Channels (BSTC) [Sellke et al. 2007 ]. BSTC has bounded support service time distributions.  ... 
doi:10.1145/3023872 fatcat:bj7jt5qwtbet3lzp5yghle4c3m

Universal data embedding in encrypted domain

Mustafa S. Abdul Karim, KokSheik Wong
2014 Signal Processing  
part of the GRC's as side information.  ...  In this work, a Universal Reversible Data Embedding method applicable to any Encrypted Domain (urDEED) is proposed. urDEED operates completely in the encrypted domain and requires no feature of the signal  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their constructive and invaluable comments in improving the quality of this article.  ... 
doi:10.1016/j.sigpro.2013.06.014 fatcat:e32a3n5s7zehhhozwkv76tycau

Algorithm Substitution Attacks from a Steganographic Perspective [article]

Sebastian Berndt, Maciej Liskiewicz
2017 arXiv   pre-print
In this paper we analyze ASAs from the perspective of steganography - the well known concept of hiding the presence of secret messages in legal communications.  ...  information while generating output indistinguishable from the honest output.  ...  following upper bound on the rate of each universal ASA: T 8.3.  ... 
arXiv:1708.06199v2 fatcat:ddbcr6npsvaf5j3jfhgeoddaxu

The P versus NP Problem [article]

Rakesh Dube
2010 arXiv   pre-print
This article was plagiarized directly from Stephen Cook's description of the problem for the Clay Mathematics Institute.  ...  See http://gauss.claymath.org:8888/millennium/P_vs_NP/pvsnp.pdf for the original text.  ...  In fact an efficient factoring algorithm would break the RSA public key encryption scheme [2] commonly used to allow (presumably) secure financial transactions over the internet.NPThe complement of the  ... 
arXiv:1001.3816v2 fatcat:ghl35v6tdjfkdmvqgl5g6cb53i

Efficient non-interactive zero-knowledge watermark detector robust to sensitivity attacks

Juan Ramón Troncoso, Fernando Pérez-González
2007 Security, Steganography, and Watermarking of Multimedia Contents IX  
In this paper, an efficient zero-knowledge version of the Generalized Gaussian Maximum Likelihood (ML) detector is introduced.  ...  Completeness, soundness and zero-knowledge properties of the developed protocols are proved, and they are compared with previous zero-knowledge watermark detection protocols in terms of receiver operating  ...  Given the security parameters F, B, T and k, the common parameters are a modulus n (that can be obtained as an RSA modulus), such that the order of Z * n can be upper bounded by 2 B , a generator h of  ... 
doi:10.1117/12.704171 dblp:conf/sswmc/Troncoso-Pastoriza07 fatcat:kqxs6ltcrreuvpu27qhhyscz4m

Zero-knowledge watermark detector robust to sensitivity attacks

Juan Ramón Troncoso-Pastoriza, Fernando Pérez-González
2006 Proceeding of the 8th workshop on Multimedia and security - MM&Sec '06  
, and also open new possibilities in the design of high level protocols.  ...  The inherent robustness that this detector presents against sensitivity attacks, together with the security provided by the zero-knowledge protocol that conceals the keys that could be used to remove the  ...  Given the security parameters F, B, T and k, the common parameters are a modulus n (that can be obtained as an RSA modulus), such that the order of Z * n can be upper bounded by 2 B , a generator h of  ... 
doi:10.1145/1161366.1161383 dblp:conf/mmsec/Troncoso-PastorizaP06 fatcat:up43vd2xmfgnbkhanffhgv3imi

Efficient Zero-Knowledge Watermark Detection with Improved Robustness to Sensitivity Attacks

Juan Ramón Troncoso-Pastoriza, Fernando Pérez-González
2007 EURASIP Journal on Information Security  
In this paper, an efficient zero-knowledge version of the generalized Gaussian maximum likelihood (ML) detector is introduced.  ...  Completeness, soundness, and zero-knowledge properties of the developed protocols are proved, and they are compared with previous zero-knowledge watermark detection protocols in terms of receiver operating  ...  ACKNOWLEDGMENTS This work was partially funded by Xunta ECRYPT disclaimer: the information in this paper is provided as is, and no guarantee or warranty is given or implied that the information is fit  ... 
doi:10.1155/2007/45731 fatcat:tbrupgg42rc7hdwqbtxshnzotq

Efficient Zero-Knowledge Watermark Detection with Improved Robustness to Sensitivity Attacks

JuanRamón Troncoso-Pastoriza, Fernando Pérez-González
2007 EURASIP Journal on Information Security  
In this paper, an efficient zero-knowledge version of the generalized Gaussian maximum likelihood (ML) detector is introduced.  ...  Completeness, soundness, and zero-knowledge properties of the developed protocols are proved, and they are compared with previous zero-knowledge watermark detection protocols in terms of receiver operating  ...  ACKNOWLEDGMENTS This work was partially funded by Xunta ECRYPT disclaimer: the information in this paper is provided as is, and no guarantee or warranty is given or implied that the information is fit  ... 
doi:10.1186/1687-417x-2007-045731 fatcat:aihs7zsc3jh7rjtg36fudpmaqu

Quantization-based semi-fragile public-key watermarking for secure image authentication

Mathias Schlauweg, Dima Proefrock, Torsten Palfner, Erika Mueller, Mark S. Schmalz
2005 Mathematics of Data/Image Coding, Compression, and Encryption VIII, with Applications  
The majority of publications in the field of digital watermarking mainly address data hiding [6, 7] , the commonly used term for both steganography and robust digital watermarking for, e.g., copyright  ...  In our approach, we extract image content dependent information, which is hashed afterwards and encrypted using secure methods known from the classical cryptography.  ...  The information embedder is primarily interested in hiding the very presence of the message itself from an observer.  ... 
doi:10.1117/12.614054 fatcat:4oboaq7f35fizijszktywl3v7y

ASAP: Algorithm Substitution Attacks on Cryptographic Protocols [article]

Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth
2020 IACR Cryptology ePrint Archive  
In fact, we show that highly desirable security properties of these protocols-forward secrecy and postcompromise security-imply the applicability of ASAs.  ...  While highly relevant as a building block, we show that the real danger of ASAs is their use in cryptographic protocols.  ...  information embeddable in a single message via black-box attacks [17] .  ... 
dblp:journals/iacr/BerndtWPTE20 fatcat:vjmaha7v65ftvfkdat5vndoujm

On the Properties of Non-Media Digital Watermarking: A Review of State of the Art Techniques

Arezou Soltani Panah, Ron Van Schyndel, Timos Sellis, Elisa Bertino
2016 IEEE Access  
For example, a loose definition of robustness might be in terms of the resilience of a watermark against normal host data operations, and of invisibility as resilience of the data interpretation against  ...  INDEX TERMS Digital watermarking, information hiding, data mining, data security, big data.  ...  and upper bounds) is {5, 10, 19, 20, 40}.  ... 
doi:10.1109/access.2016.2570812 fatcat:2xxteahvprepzekaqqbbyey7hi

Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh Networks

Rekha Patil
2013 IOSR Journal of Computer Engineering  
The approach makes use of Expected Forwarding Counter (EFW) metric to elect the primary path. We have evaluated the protocol using NS-2.  ...  In this paper, we propose a multipath routing protocol in wireless mesh networks. In this protocol, the source discovers multiple paths to the destination using parallel layer based approach.  ...  Acknowledgement The author(s) would like to thank faculty members and other contributor for their very useful advises.  ... 
doi:10.9790/0661-1360107 fatcat:gd2ulyqagveodduiy7kgh6xena

Privacy and Security Assessment of Biometric Template Protection

Xuebing Zhou
2012 it - Information Technology  
The efficiency of the practical attack confirms the result of the theoretical assessment of privacy with conditional entropy.  ...  Therefore, the presented analysis is based on efficiency of different kinds of attacks, which measure different protection goals in the appropriate threat models.  ...  Most of cryptographic methods such as RSA, public-key cryptography etc. are based on the assumption of hardness of computation problems. Their computational complexities are not really proved.  ... 
doi:10.1524/itit.2012.0676 fatcat:2pypoukudnezxpsr6zyulkodh4
« Previous Showing results 1 — 15 out of 40 results