Filters








404 Hits in 4.6 sec

Optimal resilient threshold GQ signatures

Cheng-Kang Chu, Wen-Guey Tzeng
2007 Information Sciences  
GQ signature scheme is widely used in many cryptographic protocols, such as forward-secure signature scheme, identity-based signature scheme, etc.  ...  However, there is no threshold version of this important signature scheme in the open literature. We proposed the first threshold GQ signature scheme.  ...  Key update To compute the keys of the (j + 1)th time period, each player P i computes the exponents e j+1 , e j+2 , . . . , e T for evolving the secret. 1 Then, P i computes its signing share s iðjþ1Þ  ... 
doi:10.1016/j.ins.2006.11.001 fatcat:pzku6baaaje67a2fbs2rho45rq

A Threshold GQ Signature Scheme [chapter]

Li-Shan Liu, Cheng-Kang Chu, Wen-Guey Tzeng
2003 Lecture Notes in Computer Science  
We proposed the first threshold GQ signature scheme.  ...  As an extension of our work, we proposed a threshold forward-secure signature scheme, which is the threshold version of the most efficient forward-secure signature scheme up to now.  ...  The GQ-based forward-secure signature scheme is the most efficient one with respect to the key size, and signing and verification time.  ... 
doi:10.1007/978-3-540-45203-4_11 fatcat:sigcbabr5verhk7o2si4ygti4m

Tighter Reductions for Forward-Secure Signature Schemes [chapter]

Michel Abdalla, Fabrice Ben Hamouda, David Pointcheval
2013 Lecture Notes in Computer Science  
Next, we show how to extend these results to the forward-security setting based on ideas from the Itkis-Reyzin forwardsecure signature scheme.  ...  Finally, we show that the tighter security reductions provided by our proof methodology can result in concrete efficiency gains in practice, both in the standard and forward-security setting, as long as  ...  Acknowledgments We would like to thank Mihir Bellare and Eike Kiltz for their helpful comments on a preliminary version of this paper and the anonymous referees of PKC 2013 for their valuable input.  ... 
doi:10.1007/978-3-642-36362-7_19 fatcat:maay2um3unch3htxbrwtqqz3uy

Efficient Intrusion-Resilient Signatures Without Random Oracles [chapter]

Benoît Libert, Jean-Jacques Quisquater, Moti Yung
2006 Lecture Notes in Computer Science  
Intrusion-resilient signatures are key-evolving protocols that extend the concepts of forward-secure and key-insulated signatures.  ...  As in [3, 5, 17, 18] , intrusion-resilient systems involve public keys that remain unchanged throughout the lifetime of the protocol while private keys evolve at the beginning of discrete time intervals  ...  This scheme is as efficient as the key-evolving scheme of section 3 in terms of computational cost as well as signature/key sizes. In particular, it features private keys of size O(ℓ 2 ).  ... 
doi:10.1007/11937807_3 fatcat:6blwreboijgrljw5y2smkci4sm

Practical forward secure sequential aggregate signatures

Di Ma
2008 Proceedings of the 2008 ACM symposium on Information, computer and communications security - ASIACCS '08  
Such a signature offers forward security, storage/communication efficiency, as well as overall integrity of the signed messages.  ...  Unlike the scheme in [21], each new scheme has constant-size public and private keys, constant-size signatures as well as constant-time key update and signature generation complexity.  ...  Guilin Wang for his time analyzing the security of proposed schemes. Furthermore, the author is grateful to the anonymous reviewers for their valuable comments.  ... 
doi:10.1145/1368310.1368361 dblp:conf/ccs/Ma08 fatcat:ioldi3ms2bdjrlty3yryjl4yzi

Generalized Key-Evolving Signature Schemes or How to Foil an Armed Adversary [chapter]

Gene Itkis, Peng Xie
2003 Lecture Notes in Computer Science  
For digital signatures such a recovery should ideally -and when possibleinclude invalidation of the signatures issued with the compromised keys.  ...  We propose a definition of generalized key-evolving signature scheme, which unifies forward-security and security against the coercive and inconspicuous key exposures (previously considered separately  ...  The authors are grateful to Shai Halevi for helpful discussions.  ... 
doi:10.1007/978-3-540-45203-4_12 fatcat:auojagjsmrc4blw46bbz55pjh4

Key Management Protocol with Implicit Certificates for IoT systems

Savio Sciancalepore, Angelo Capossele, Giuseppe Piro, Gennaro Boggia, Giuseppe Bianchi
2015 Proceedings of the 2015 Workshop on IoT challenges in Mobile and Industrial Systems - IoT-Sys '15  
This paper proposes a Key Management Protocol for mobile and industrial Internet of Things systems, targeting, at the same time, robust key negotiation, lightweight node authentication, fast re-keying,  ...  To prove its viability, the proposed Key Management Protocol has been implemented and assessed on severely constrained devices.  ...  In this evolving context, security risks and threats are ever more critical; as such the research community and the standardization bodies are currently working to define novel methodologies, protocols  ... 
doi:10.1145/2753476.2753477 dblp:conf/mobisys/SciancaleporeCP15 fatcat:4z44orciibb75ll5yxe7gqkxye

Preventing Unofficial Information Propagation [chapter]

Zhengyi Le, Yi Ouyang, Yurong Xu, James Ford, Fillia Makedon
2007 Lecture Notes in Computer Science  
The proposed approach in this paper uses shortlived credentials based on reverse forward secure signatures to remove this assumption and mitigate the damage caused by a dishonest or honest but compromised  ...  Existing work such as access control policies and the Platform for Privacy Preferences (P3P) assumes that qualified or certified credential viewers are honest and reliable.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1007/978-3-540-77048-0_9 fatcat:mum56frjifbndhjnkwdqarjvsu

Secure provenance

Rongxing Lu, Xiaodong Lin, Xiaohui Liang, Xuemin (Sherman) Shen
2010 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS '10  
With the provable security techniques, we formally demonstrate the proposed scheme is secure in the standard model.  ...  As the essential bread and butter of data forensics and post investigation in cloud computing, the proposed scheme is characterized by providing the information confidentiality on sensitive documents stored  ...  key generation oracle OK and the signature oracle OS, respectively.  ... 
doi:10.1145/1755688.1755723 dblp:conf/ccs/LuLLS10 fatcat:io4swhbpsjdblongml3houtm5q

Forgery-resilience for digital signature schemes

Atefeh Mashatan, Khaled Ouafi
2012 Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security - ASIACCS '12  
It evolves around the idea that, for any message, there can only be a unique valid signature, and exponentially many acceptable signatures, all but one of them being spurious.  ...  We introduce the notion of forgery-resilience for digital signature schemes, a new paradigm for digital signature schemes exhibiting desirable legislative properties.  ...  We also would like to thank the anonymous reviewers for helping us to improve this paper.  ... 
doi:10.1145/2414456.2414469 dblp:conf/ccs/MashatanO12 fatcat:j7wspqwl35h2hasrchotwkbeum

Rational design of a heterotrimeric G protein α subunit with artificial inhibitor sensitivity

Davide Malfacini, Julian Patt, Suvi Annala, Kasper Harpsøe, Funda Eryilmaz, Raphael Reher, Max Crüsemann, Wiebke Hanke, Hang Zhang, Daniel Tietze, David E Gloriam, Hans Bräuner-Osborne (+5 others)
2019 Journal of Biological Chemistry  
Using CRISPR/Cas9-generated Gαq/Gα11-null cells and loss- and gain-of-function mutagenesis along with label-free whole-cell biosensing, we determined the molecular coordinates for FR/YM inhibition of Gq  ...  Transmembrane signals initiated by a range of extracellular stimuli converge on members of the Gq family of heterotrimeric G proteins, which relay these signals in target cells.  ...  PRIME JP17gm5910013 and the LEAP JP17gm0010004 from the Japan Agency for Medical Research and Development partially supported this work (grants to A.I.).  ... 
doi:10.1074/jbc.ra118.007250 pmid:30745359 pmcid:PMC6463727 fatcat:t3cgcao5g5gghcb7jrzbm7gqwm

AgRP Neurons Control Systemic Insulin Sensitivity via Myostatin Expression in Brown Adipose Tissue

Sophie M. Steculorum, Johan Ruud, Ismene Karakasilioti, Heiko Backes, Linda Engström Ruud, Katharina Timper, Martin E. Hess, Eva Tsaousidou, Jan Mauer, Merly C. Vogt, Lars Paeger, Stephan Bremser (+10 others)
2016 Cell  
We thank Michael Dübbert and Jan Sydow (Electronics Lab, Institute for Zoology, University of Cologne) for providing us with the laser sources used for optogenetic and Ca 2+ -imaging experiments.  ...  Acknowledgments We are grateful to Eli Lilly and company for providing control-and anti-myostatin antibodies.  ...  Another key finding of the present study is how rapidly, within only 1 hr of AgRP neuron activation, the transcriptional signature of BAT is altered toward a coordinated upregulation of mRNAs, which are  ... 
doi:10.1016/j.cell.2016.02.044 pmid:27015310 pmcid:PMC5157157 fatcat:2d5m2paeljedvan4fc557jk5xy

Generic Fully Simulatable Adaptive Oblivious Transfer [chapter]

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
2011 Lecture Notes in Computer Science  
The factorization of N is for odd, distinct primes p i , integers r i ≥ 1, and ν ≥ 1. We suggest the following 4-move protocol showing that gcd N, φ(N ) = 1.  ...  The "assisted decryption" approach: Beginning with the work of Ogata and Kurosawa [30], at the core of this approach is a blind signature scheme.  ...  DCR assumption: Set ϕ(u) = u N mod N for u ∈ Z N , so that the atomic WIPK is similar to the GQ proof [15] .  ... 
doi:10.1007/978-3-642-21554-4_16 fatcat:vb7ct36awzb45hgmo7s34laxma

Generic Fully Simulatable Adaptive Oblivious Transfer

Kaoru KUROSAWA, Ryo NOJIMA, Le Trieu PHONG
2015 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
The factorization of N is for odd, distinct primes p i , integers r i ≥ 1, and ν ≥ 1. We suggest the following 4-move protocol showing that gcd N, φ(N ) = 1.  ...  The "assisted decryption" approach: Beginning with the work of Ogata and Kurosawa [30], at the core of this approach is a blind signature scheme.  ...  DCR assumption: Set ϕ(u) = u N mod N for u ∈ Z N , so that the atomic WIPK is similar to the GQ proof [15] .  ... 
doi:10.1587/transfun.e98.a.232 fatcat:uzt7s5dlvbg57gmyqlrrgq3xzy

A Lightweight Identification Protocol for Embedded Devices [article]

Abdoulaye Mbaye, Abdoul Aziz Ciss, Oumar Niang
2014 arXiv   pre-print
The task of this paper is to introduce a new lightweight identification protocol based on biometric data and elliptic curves.  ...  Our scheme is light, very fast, secure and robust against all the known attacks on identification protocol. Therefore, one can use it in any constraint device such as embedded systems.  ...  Many protocols exist, and many variations evolving despite the findings of some security vulnerabilities.  ... 
arXiv:1408.5945v2 fatcat:vv6yatca2zagbilt4hq2adtjzu
« Previous Showing results 1 — 15 out of 404 results